./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/combinations/gcd_4+newton_2_5.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 8402c5691f7146360213fdb1e8b03143db0d7add581e1f213f9dfbebb48edc07 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:47:20,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:47:20,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:47:20,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:47:20,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:47:20,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:47:20,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:47:20,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:47:20,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:47:20,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:47:20,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:47:20,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:47:20,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:47:20,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:47:20,924 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:47:20,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:47:20,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:47:20,927 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:47:20,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:47:20,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:47:20,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:47:20,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:47:20,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:47:20,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:47:20,933 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:47:20,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:47:20,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:47:20,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:47:20,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:47:20,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:47:20,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:47:20,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:47:20,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:47:20,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:47:20,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:47:20,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:47:20,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:47:20,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:47:20,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:47:20,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:47:20,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:47:20,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:47:20,940 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 -> 8402c5691f7146360213fdb1e8b03143db0d7add581e1f213f9dfbebb48edc07 [2024-10-14 04:47:21,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:47:21,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:47:21,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:47:21,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:47:21,271 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:47:21,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i [2024-10-14 04:47:22,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:47:22,947 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:47:22,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i [2024-10-14 04:47:22,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d05f13a83/4ba6145dd9d84c0ca0d8ac0132b663ca/FLAGfadaf29ed [2024-10-14 04:47:23,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d05f13a83/4ba6145dd9d84c0ca0d8ac0132b663ca [2024-10-14 04:47:23,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:47:23,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:47:23,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:47:23,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:47:23,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:47:23,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78838b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23, skipping insertion in model container [2024-10-14 04:47:23,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:47:23,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i[1224,1237] [2024-10-14 04:47:23,530 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i[2827,2840] [2024-10-14 04:47:23,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:47:23,538 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:47:23,548 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i[1224,1237] [2024-10-14 04:47:23,555 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i[2827,2840] [2024-10-14 04:47:23,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:47:23,569 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:47:23,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23 WrapperNode [2024-10-14 04:47:23,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:47:23,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:47:23,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:47:23,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:47:23,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,621 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 79 [2024-10-14 04:47:23,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:47:23,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:47:23,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:47:23,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:47:23,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,651 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-14 04:47:23,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:47:23,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:47:23,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:47:23,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:47:23,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (1/1) ... [2024-10-14 04:47:23,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:47:23,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:47:23,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 04:47:23,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 04:47:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:47:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-10-14 04:47:23,781 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-10-14 04:47:23,782 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-14 04:47:23,783 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-14 04:47:23,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:47:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 04:47:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:47:23,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:47:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 04:47:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 04:47:23,859 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:47:23,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:47:24,079 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-14 04:47:24,079 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:47:24,099 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:47:24,099 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 04:47:24,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:47:24 BoogieIcfgContainer [2024-10-14 04:47:24,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:47:24,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:47:24,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:47:24,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:47:24,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:47:23" (1/3) ... [2024-10-14 04:47:24,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741ee02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:47:24, skipping insertion in model container [2024-10-14 04:47:24,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:23" (2/3) ... [2024-10-14 04:47:24,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741ee02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:47:24, skipping insertion in model container [2024-10-14 04:47:24,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:47:24" (3/3) ... [2024-10-14 04:47:24,106 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_5.i [2024-10-14 04:47:24,126 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:47:24,127 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:47:24,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:47:24,183 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;@26cbc1a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:47:24,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:47:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 04:47:24,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 04:47:24,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:47:24,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:47:24,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:47:24,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:47:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash 531794030, now seen corresponding path program 1 times [2024-10-14 04:47:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:47:24,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449715980] [2024-10-14 04:47:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:47:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:47:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:47:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:47:24,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:47:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449715980] [2024-10-14 04:47:24,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449715980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:47:24,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:47:24,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:47:24,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934955366] [2024-10-14 04:47:24,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:47:24,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:47:24,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:47:24,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:47:24,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:47:24,457 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:47:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:47:24,502 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2024-10-14 04:47:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:47:24,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 04:47:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:47:24,513 INFO L225 Difference]: With dead ends: 73 [2024-10-14 04:47:24,514 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 04:47:24,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-14 04:47:24,520 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:47:24,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 62 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:47:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 04:47:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-10-14 04:47:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 04:47:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-14 04:47:24,550 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 10 [2024-10-14 04:47:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:47:24,551 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-14 04:47:24,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:47:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-14 04:47:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 04:47:24,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:47:24,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:47:24,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:47:24,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:47:24,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:47:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2010454398, now seen corresponding path program 1 times [2024-10-14 04:47:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:47:24,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628804253] [2024-10-14 04:47:24,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:47:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:47:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:47:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:47:24,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:47:24,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628804253] [2024-10-14 04:47:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628804253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:47:24,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:47:24,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:47:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056404832] [2024-10-14 04:47:24,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:47:24,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:47:24,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:47:24,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:47:24,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:47:24,620 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:47:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:47:24,640 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-14 04:47:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:47:24,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 04:47:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:47:24,641 INFO L225 Difference]: With dead ends: 49 [2024-10-14 04:47:24,641 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 04:47:24,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-14 04:47:24,643 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:47:24,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 57 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:47:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 04:47:24,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-14 04:47:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 04:47:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-14 04:47:24,650 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 12 [2024-10-14 04:47:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:47:24,650 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-14 04:47:24,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:47:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-14 04:47:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 04:47:24,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:47:24,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:47:24,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:47:24,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:47:24,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:47:24,653 INFO L85 PathProgramCache]: Analyzing trace with hash -466694725, now seen corresponding path program 1 times [2024-10-14 04:47:24,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:47:24,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143839737] [2024-10-14 04:47:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:47:24,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:47:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:47:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:47:24,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:47:24,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143839737] [2024-10-14 04:47:24,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143839737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:47:24,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:47:24,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:47:24,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684430409] [2024-10-14 04:47:24,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:47:24,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:47:24,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:47:24,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:47:24,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:47:24,790 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:47:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:47:24,822 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-10-14 04:47:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:47:24,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 04:47:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:47:24,823 INFO L225 Difference]: With dead ends: 50 [2024-10-14 04:47:24,823 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 04:47:24,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-14 04:47:24,825 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:47:24,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:47:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 04:47:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-14 04:47:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 04:47:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-14 04:47:24,835 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 14 [2024-10-14 04:47:24,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:47:24,836 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-14 04:47:24,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:47:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-14 04:47:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 04:47:24,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:47:24,838 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:47:24,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:47:24,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:47:24,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:47:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1903157512, now seen corresponding path program 1 times [2024-10-14 04:47:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:47:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459000073] [2024-10-14 04:47:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:47:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:47:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:47:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:47:25,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:47:25,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459000073] [2024-10-14 04:47:25,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459000073] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:47:25,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991530381] [2024-10-14 04:47:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:47:25,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:47:25,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:47:25,006 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 04:47:25,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 04:47:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:47:25,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 04:47:25,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:47:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:47:25,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 04:47:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:47:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991530381] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 04:47:25,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 04:47:25,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-10-14 04:47:25,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513966301] [2024-10-14 04:47:25,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 04:47:25,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 04:47:25,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:47:25,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 04:47:25,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 04:47:25,199 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:47:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:47:25,250 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2024-10-14 04:47:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 04:47:25,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 04:47:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:47:25,254 INFO L225 Difference]: With dead ends: 54 [2024-10-14 04:47:25,255 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 04:47:25,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 04:47:25,256 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:47:25,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:47:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 04:47:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 04:47:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 04:47:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-10-14 04:47:25,269 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 16 [2024-10-14 04:47:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:47:25,269 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-14 04:47:25,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:47:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-10-14 04:47:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 04:47:25,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:47:25,270 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:47:25,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 04:47:25,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:47:25,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:47:25,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:47:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1416757394, now seen corresponding path program 1 times [2024-10-14 04:47:25,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:47:25,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657462547] [2024-10-14 04:47:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:47:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:47:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 04:47:25,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 04:47:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 04:47:25,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 04:47:25,497 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 04:47:25,498 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-14 04:47:25,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-14 04:47:25,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:47:25,506 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 04:47:25,522 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 04:47:25,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:47:25 BoogieIcfgContainer [2024-10-14 04:47:25,525 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 04:47:25,526 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 04:47:25,526 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 04:47:25,526 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 04:47:25,526 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:47:24" (3/4) ... [2024-10-14 04:47:25,528 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 04:47:25,528 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 04:47:25,529 INFO L158 Benchmark]: Toolchain (without parser) took 2181.51ms. Allocated memory is still 199.2MB. Free memory was 170.8MB in the beginning and 64.8MB in the end (delta: 106.0MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2024-10-14 04:47:25,529 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 04:47:25,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.73ms. Allocated memory is still 199.2MB. Free memory was 170.8MB in the beginning and 157.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 04:47:25,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.99ms. Allocated memory is still 199.2MB. Free memory was 157.6MB in the beginning and 156.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 04:47:25,531 INFO L158 Benchmark]: Boogie Preprocessor took 56.97ms. Allocated memory is still 199.2MB. Free memory was 156.5MB in the beginning and 154.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 04:47:25,531 INFO L158 Benchmark]: RCFGBuilder took 419.85ms. Allocated memory is still 199.2MB. Free memory was 154.4MB in the beginning and 162.3MB in the end (delta: -7.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 04:47:25,533 INFO L158 Benchmark]: TraceAbstraction took 1424.23ms. Allocated memory is still 199.2MB. Free memory was 161.2MB in the beginning and 64.8MB in the end (delta: 96.5MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-10-14 04:47:25,533 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 199.2MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 04:47:25,534 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.29ms. Allocated memory is still 109.1MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.73ms. Allocated memory is still 199.2MB. Free memory was 170.8MB in the beginning and 157.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.99ms. Allocated memory is still 199.2MB. Free memory was 157.6MB in the beginning and 156.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.97ms. Allocated memory is still 199.2MB. Free memory was 156.5MB in the beginning and 154.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.85ms. Allocated memory is still 199.2MB. Free memory was 154.4MB in the beginning and 162.3MB in the end (delta: -7.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1424.23ms. Allocated memory is still 199.2MB. Free memory was 161.2MB in the beginning and 64.8MB in the end (delta: 96.5MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 199.2MB. Free memory is still 64.8MB. 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: 109]: 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 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 102. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -1.0f && IN < 1.0f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -1.0f && IN < 1.0f) [L100] CALL, EXPR f(IN) VAL [\old(x)=110] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L100] RET, EXPR f(IN) VAL [IN=110] [L100] CALL, EXPR fp(IN) VAL [\old(x)=110] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L100] RET, EXPR fp(IN) VAL [IN=110] [L100] float x = IN - f(IN)/fp(IN); [L102] CALL, EXPR f(x) VAL [\old(x)=111] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L102] RET, EXPR f(x) VAL [IN=110, x=111] [L102] CALL, EXPR fp(x) VAL [\old(x)=111] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L102] RET, EXPR fp(x) VAL [IN=110, x=111] [L102] x = x - f(x)/fp(x) [L108] COND TRUE !(x < 0.1) VAL [IN=110] [L109] reach_error() VAL [IN=110] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 124 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 249 SizeOfPredicates, 2 NumberOfNonLiveVariables, 80 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 5/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 04:47:25,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.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 8402c5691f7146360213fdb1e8b03143db0d7add581e1f213f9dfbebb48edc07 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:47:27,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:47:27,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 04:47:27,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:47:27,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:47:27,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:47:27,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:47:27,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:47:27,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:47:27,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:47:27,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:47:27,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:47:27,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:47:27,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:47:27,754 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:47:27,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:47:27,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:47:27,755 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:47:27,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:47:27,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:47:27,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:47:27,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:47:27,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:47:27,758 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 04:47:27,759 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 04:47:27,759 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:47:27,759 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 04:47:27,759 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:47:27,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:47:27,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:47:27,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:47:27,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:47:27,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:47:27,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:47:27,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:47:27,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:47:27,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:47:27,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:47:27,763 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 04:47:27,763 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 04:47:27,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:47:27,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:47:27,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:47:27,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:47:27,765 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 04:47:27,766 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 -> 8402c5691f7146360213fdb1e8b03143db0d7add581e1f213f9dfbebb48edc07 [2024-10-14 04:47:28,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:47:28,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:47:28,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:47:28,080 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:47:28,081 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:47:28,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i [2024-10-14 04:47:29,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:47:29,630 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:47:29,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i [2024-10-14 04:47:29,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde8d35c6/cf43a75d63904f7280c0101f246d4128/FLAGbef781fcd [2024-10-14 04:47:29,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde8d35c6/cf43a75d63904f7280c0101f246d4128 [2024-10-14 04:47:29,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:47:29,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:47:29,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:47:29,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:47:29,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:47:29,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:29,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0333bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29, skipping insertion in model container [2024-10-14 04:47:29,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:29,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:47:29,814 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i[1224,1237] [2024-10-14 04:47:29,856 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i[2827,2840] [2024-10-14 04:47:29,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:47:29,875 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:47:29,895 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i[1224,1237] [2024-10-14 04:47:29,910 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_5.i[2827,2840] [2024-10-14 04:47:29,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:47:29,934 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:47:29,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29 WrapperNode [2024-10-14 04:47:29,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:47:29,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:47:29,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:47:29,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:47:29,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:29,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:29,985 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76 [2024-10-14 04:47:29,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:47:29,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:47:29,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:47:29,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:47:29,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:29,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:30,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:30,020 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-14 04:47:30,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:30,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:30,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:30,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:30,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:30,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:30,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:47:30,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:47:30,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:47:30,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:47:30,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (1/1) ... [2024-10-14 04:47:30,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:47:30,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:47:30,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 04:47:30,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 04:47:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:47:30,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 04:47:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 04:47:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-10-14 04:47:30,137 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-10-14 04:47:30,137 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-14 04:47:30,138 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-14 04:47:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:47:30,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:47:30,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 04:47:30,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 04:47:30,220 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:47:30,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:47:40,527 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-14 04:47:40,529 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:47:40,576 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:47:40,580 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 04:47:40,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:47:40 BoogieIcfgContainer [2024-10-14 04:47:40,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:47:40,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:47:40,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:47:40,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:47:40,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:47:29" (1/3) ... [2024-10-14 04:47:40,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4473e091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:47:40, skipping insertion in model container [2024-10-14 04:47:40,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:29" (2/3) ... [2024-10-14 04:47:40,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4473e091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:47:40, skipping insertion in model container [2024-10-14 04:47:40,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:47:40" (3/3) ... [2024-10-14 04:47:40,596 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_5.i [2024-10-14 04:47:40,617 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:47:40,617 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:47:40,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:47:40,687 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;@2001746a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:47:40,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:47:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 04:47:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 04:47:40,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:47:40,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:47:40,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:47:40,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:47:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash 531794030, now seen corresponding path program 1 times [2024-10-14 04:47:40,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 04:47:40,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436347579] [2024-10-14 04:47:40,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:47:40,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 04:47:40,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 04:47:40,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 04:47:40,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 04:47:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:47:40,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 04:47:40,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:47:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:47:40,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:47:40,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 04:47:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436347579] [2024-10-14 04:47:40,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436347579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:47:40,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:47:40,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:47:40,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602063460] [2024-10-14 04:47:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:47:40,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:47:40,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 04:47:40,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:47:40,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:47:40,925 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:47:45,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:47:50,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:47:54,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:47:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:47:54,749 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2024-10-14 04:47:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:47:54,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 04:47:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:47:54,757 INFO L225 Difference]: With dead ends: 73 [2024-10-14 04:47:54,757 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 04:47:54,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10-14 04:47:54,763 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:47:54,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 62 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 13.8s Time] [2024-10-14 04:47:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 04:47:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-10-14 04:47:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 04:47:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-14 04:47:54,791 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 10 [2024-10-14 04:47:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:47:54,791 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-14 04:47:54,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:47:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-14 04:47:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 04:47:54,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:47:54,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:47:54,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 04:47:54,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 04:47:54,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:47:54,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:47:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2010454398, now seen corresponding path program 1 times [2024-10-14 04:47:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 04:47:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314343585] [2024-10-14 04:47:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:47:54,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 04:47:54,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 04:47:54,998 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 04:47:54,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 04:47:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:47:55,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 04:47:55,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:47:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:47:55,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:47:55,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 04:47:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314343585] [2024-10-14 04:47:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314343585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:47:55,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:47:55,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:47:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328947497] [2024-10-14 04:47:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:47:55,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:47:55,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 04:47:55,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:47:55,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:47:55,182 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:47:59,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:03,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:07,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:11,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:11,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:48:11,507 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-14 04:48:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:48:11,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 04:48:11,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:48:11,509 INFO L225 Difference]: With dead ends: 49 [2024-10-14 04:48:11,509 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 04:48:11,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-10-14 04:48:11,510 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:48:11,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 57 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 16.3s Time] [2024-10-14 04:48:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 04:48:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-14 04:48:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 04:48:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-14 04:48:11,516 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 12 [2024-10-14 04:48:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:48:11,516 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-14 04:48:11,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:48:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-14 04:48:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 04:48:11,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:48:11,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:48:11,529 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 (3)] Ended with exit code 0 [2024-10-14 04:48:11,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 04:48:11,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:48:11,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:48:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash -466694725, now seen corresponding path program 1 times [2024-10-14 04:48:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 04:48:11,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194758038] [2024-10-14 04:48:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:48:11,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 04:48:11,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 04:48:11,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 04:48:11,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 04:48:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:48:11,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 04:48:11,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:48:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:48:12,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:48:12,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 04:48:12,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194758038] [2024-10-14 04:48:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194758038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:48:12,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:48:12,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 04:48:12,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139900594] [2024-10-14 04:48:12,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:48:12,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:48:12,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 04:48:12,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:48:12,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:48:12,147 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:48:16,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:18,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:23,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:24,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:48:24,275 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-10-14 04:48:24,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:48:24,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 04:48:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:48:24,276 INFO L225 Difference]: With dead ends: 50 [2024-10-14 04:48:24,277 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 04:48:24,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 04:48:24,278 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:48:24,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2024-10-14 04:48:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 04:48:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-14 04:48:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 04:48:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-14 04:48:24,289 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 14 [2024-10-14 04:48:24,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:48:24,290 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-14 04:48:24,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:48:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-14 04:48:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 04:48:24,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:48:24,293 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:48:24,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 04:48:24,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 04:48:24,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:48:24,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:48:24,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1903157512, now seen corresponding path program 1 times [2024-10-14 04:48:24,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 04:48:24,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231853739] [2024-10-14 04:48:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:48:24,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 04:48:24,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 04:48:24,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 04:48:24,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 04:48:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:48:24,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 04:48:24,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:48:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:48:25,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 04:48:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:48:25,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 04:48:25,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231853739] [2024-10-14 04:48:25,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231853739] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 04:48:25,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 04:48:25,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-14 04:48:25,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411084020] [2024-10-14 04:48:25,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 04:48:25,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:48:25,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 04:48:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:48:25,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:48:25,517 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:48:29,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:33,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:37,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:41,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:45,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:50,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:54,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:48:58,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:49:02,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:49:06,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 04:49:06,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:49:06,621 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2024-10-14 04:49:06,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 04:49:06,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 04:49:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:49:06,622 INFO L225 Difference]: With dead ends: 54 [2024-10-14 04:49:06,623 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 04:49:06,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:49:06,624 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:49:06,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 10 Unknown, 0 Unchecked, 41.1s Time] [2024-10-14 04:49:06,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 04:49:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 04:49:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 04:49:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-10-14 04:49:06,628 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 16 [2024-10-14 04:49:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:49:06,629 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-14 04:49:06,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 04:49:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-10-14 04:49:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 04:49:06,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:49:06,630 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:49:06,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 04:49:06,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 04:49:06,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:49:06,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:49:06,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1416757394, now seen corresponding path program 1 times [2024-10-14 04:49:06,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 04:49:06,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207872047] [2024-10-14 04:49:06,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:49:06,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 04:49:06,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 04:49:06,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 04:49:06,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process