./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c --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/float-newlib/double_req_bl_1252a.c -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 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:50:13,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:50:13,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 00:50:13,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:50:13,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:50:13,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:50:13,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:50:13,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:50:13,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:50:13,975 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:50:13,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:50:13,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:50:13,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:50:13,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:50:13,977 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:50:13,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:50:13,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:50:13,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:50:13,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 00:50:13,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:50:13,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:50:13,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:50:13,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:50:13,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:50:13,980 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:50:13,980 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:50:13,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:50:13,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:50:13,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:50:13,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:50:13,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:50:13,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:50:13,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:50:13,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:50:13,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:50:13,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:50:13,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 00:50:13,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 00:50:13,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:50:13,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:50:13,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:50:13,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:50:13,986 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 -> 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e [2024-10-14 00:50:14,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:50:14,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:50:14,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:50:14,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:50:14,300 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:50:14,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2024-10-14 00:50:15,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:50:15,736 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:50:15,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2024-10-14 00:50:15,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e3a815c/bb1ac23bc19a42148614dc8fddc336a9/FLAG67e1cb6f4 [2024-10-14 00:50:16,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26e3a815c/bb1ac23bc19a42148614dc8fddc336a9 [2024-10-14 00:50:16,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:50:16,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:50:16,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:50:16,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:50:16,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:50:16,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc14517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16, skipping insertion in model container [2024-10-14 00:50:16,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:50:16,344 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/float-newlib/double_req_bl_1252a.c[2154,2167] [2024-10-14 00:50:16,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:50:16,358 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:50:16,377 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/float-newlib/double_req_bl_1252a.c[2154,2167] [2024-10-14 00:50:16,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:50:16,390 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:50:16,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16 WrapperNode [2024-10-14 00:50:16,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:50:16,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:50:16,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:50:16,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:50:16,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,420 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-10-14 00:50:16,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:50:16,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:50:16,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:50:16,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:50:16,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,444 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-10-14 00:50:16,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:50:16,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:50:16,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:50:16,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:50:16,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (1/1) ... [2024-10-14 00:50:16,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:50:16,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:50:16,498 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 00:50:16,501 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 00:50:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:50:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 00:50:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 00:50:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 00:50:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 00:50:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-14 00:50:16,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-14 00:50:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 00:50:16,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 00:50:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 00:50:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:50:16,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:50:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 00:50:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 00:50:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 00:50:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 00:50:16,635 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:50:16,637 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:50:16,859 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 00:50:16,860 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:50:16,878 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:50:16,878 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 00:50:16,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:16 BoogieIcfgContainer [2024-10-14 00:50:16,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:50:16,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:50:16,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:50:16,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:50:16,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:50:16" (1/3) ... [2024-10-14 00:50:16,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11613899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:50:16, skipping insertion in model container [2024-10-14 00:50:16,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:16" (2/3) ... [2024-10-14 00:50:16,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11613899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:50:16, skipping insertion in model container [2024-10-14 00:50:16,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:16" (3/3) ... [2024-10-14 00:50:16,891 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2024-10-14 00:50:16,914 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:50:16,914 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:50:16,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:50:16,995 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;@79f5276b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:50:16,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:50:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 00:50:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 00:50:17,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:17,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:17,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:17,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2030686387, now seen corresponding path program 1 times [2024-10-14 00:50:17,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:17,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740603881] [2024-10-14 00:50:17,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:50:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:17,203 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 00:50:17,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:50:17,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740603881] [2024-10-14 00:50:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740603881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:17,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:50:17,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114213982] [2024-10-14 00:50:17,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:17,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:50:17,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:50:17,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:50:17,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:50:17,230 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:17,265 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2024-10-14 00:50:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:50:17,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-14 00:50:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:17,275 INFO L225 Difference]: With dead ends: 50 [2024-10-14 00:50:17,275 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 00:50:17,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 00:50:17,280 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:17,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:17,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 00:50:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 00:50:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 00:50:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-14 00:50:17,309 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-10-14 00:50:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:17,310 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-14 00:50:17,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-14 00:50:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 00:50:17,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:17,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:17,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 00:50:17,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:17,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:17,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1660176756, now seen corresponding path program 1 times [2024-10-14 00:50:17,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:17,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331892724] [2024-10-14 00:50:17,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:17,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:17,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:50:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:17,481 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 00:50:17,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:50:17,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331892724] [2024-10-14 00:50:17,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331892724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:17,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:17,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:50:17,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929065805] [2024-10-14 00:50:17,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:17,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:50:17,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:50:17,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:50:17,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:17,484 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:17,514 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-14 00:50:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:50:17,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-14 00:50:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:17,517 INFO L225 Difference]: With dead ends: 36 [2024-10-14 00:50:17,517 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 00:50:17,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:17,518 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:17,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 00:50:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 00:50:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 00:50:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-14 00:50:17,533 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2024-10-14 00:50:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:17,533 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-14 00:50:17,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-14 00:50:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 00:50:17,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:17,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:17,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 00:50:17,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:17,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1141436138, now seen corresponding path program 1 times [2024-10-14 00:50:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:17,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057996541] [2024-10-14 00:50:17,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:17,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:50:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:17,660 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 00:50:17,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:50:17,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057996541] [2024-10-14 00:50:17,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057996541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:17,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:17,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:50:17,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254721843] [2024-10-14 00:50:17,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:17,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:50:17,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:50:17,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:50:17,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:17,665 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:17,713 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-14 00:50:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:50:17,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-14 00:50:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:17,714 INFO L225 Difference]: With dead ends: 40 [2024-10-14 00:50:17,714 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 00:50:17,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:17,716 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:17,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 00:50:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-14 00:50:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 00:50:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-14 00:50:17,721 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 15 [2024-10-14 00:50:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:17,722 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-14 00:50:17,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-14 00:50:17,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 00:50:17,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:17,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:17,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 00:50:17,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:17,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash -731973192, now seen corresponding path program 1 times [2024-10-14 00:50:17,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:17,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794635590] [2024-10-14 00:50:17,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:17,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:17,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:50:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:17,822 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 00:50:17,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:50:17,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794635590] [2024-10-14 00:50:17,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794635590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:17,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:17,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:50:17,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134337231] [2024-10-14 00:50:17,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:17,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:50:17,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:50:17,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:50:17,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:17,826 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:17,867 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-14 00:50:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:50:17,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-14 00:50:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:17,869 INFO L225 Difference]: With dead ends: 40 [2024-10-14 00:50:17,869 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 00:50:17,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:17,870 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:17,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 00:50:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-14 00:50:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 00:50:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-14 00:50:17,881 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 16 [2024-10-14 00:50:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:17,882 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-14 00:50:17,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-14 00:50:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 00:50:17,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:17,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:17,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 00:50:17,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:17,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:17,884 INFO L85 PathProgramCache]: Analyzing trace with hash 436592986, now seen corresponding path program 1 times [2024-10-14 00:50:17,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:17,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266392499] [2024-10-14 00:50:17,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:17,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:17,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:50:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:18,005 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 00:50:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:50:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266392499] [2024-10-14 00:50:18,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266392499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:18,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:18,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:50:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968808277] [2024-10-14 00:50:18,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:18,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:50:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:50:18,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:50:18,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:18,008 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:18,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:18,035 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-14 00:50:18,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:50:18,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-14 00:50:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:18,036 INFO L225 Difference]: With dead ends: 40 [2024-10-14 00:50:18,036 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 00:50:18,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:18,037 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:18,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 00:50:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-14 00:50:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 00:50:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-14 00:50:18,042 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2024-10-14 00:50:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:18,042 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-14 00:50:18,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-14 00:50:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 00:50:18,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:18,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:18,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 00:50:18,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:18,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:18,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1370861477, now seen corresponding path program 1 times [2024-10-14 00:50:18,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:18,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466699021] [2024-10-14 00:50:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:18,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 00:50:18,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 00:50:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 00:50:18,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 00:50:18,090 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 00:50:18,091 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 00:50:18,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 00:50:18,099 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 00:50:18,119 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 00:50:18,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:50:18 BoogieIcfgContainer [2024-10-14 00:50:18,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 00:50:18,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 00:50:18,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 00:50:18,125 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 00:50:18,125 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:16" (3/4) ... [2024-10-14 00:50:18,127 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 00:50:18,128 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 00:50:18,129 INFO L158 Benchmark]: Toolchain (without parser) took 1978.82ms. Allocated memory was 192.9MB in the beginning and 249.6MB in the end (delta: 56.6MB). Free memory was 114.4MB in the beginning and 197.7MB in the end (delta: -83.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:50:18,129 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 192.9MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:50:18,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.24ms. Allocated memory is still 192.9MB. Free memory was 114.2MB in the beginning and 161.0MB in the end (delta: -46.8MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-10-14 00:50:18,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.11ms. Allocated memory is still 192.9MB. Free memory was 161.0MB in the beginning and 158.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:50:18,131 INFO L158 Benchmark]: Boogie Preprocessor took 36.48ms. Allocated memory is still 192.9MB. Free memory was 158.9MB in the beginning and 156.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:50:18,131 INFO L158 Benchmark]: RCFGBuilder took 420.21ms. Allocated memory is still 192.9MB. Free memory was 156.8MB in the beginning and 151.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 00:50:18,131 INFO L158 Benchmark]: TraceAbstraction took 1243.50ms. Allocated memory was 192.9MB in the beginning and 249.6MB in the end (delta: 56.6MB). Free memory was 151.1MB in the beginning and 198.7MB in the end (delta: -47.6MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-10-14 00:50:18,132 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 249.6MB. Free memory was 198.7MB in the beginning and 197.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:50:18,133 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 192.9MB. Free memory is still 159.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.24ms. Allocated memory is still 192.9MB. Free memory was 114.2MB in the beginning and 161.0MB in the end (delta: -46.8MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.11ms. Allocated memory is still 192.9MB. Free memory was 161.0MB in the beginning and 158.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.48ms. Allocated memory is still 192.9MB. Free memory was 158.9MB in the beginning and 156.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 420.21ms. Allocated memory is still 192.9MB. Free memory was 156.8MB in the beginning and 151.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1243.50ms. Allocated memory was 192.9MB in the beginning and 249.6MB in the end (delta: 56.6MB). Free memory was 151.1MB in the beginning and 198.7MB in the end (delta: -47.6MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 249.6MB. Free memory was 198.7MB in the beginning and 197.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 87]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someUnaryDOUBLEoperation at line 81. Possible FailurePath: [L81] double x = -0.0; [L82] double y = 0.0; [L83] CALL, EXPR fmax_double(x, y) [L54] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967306] [L26] __uint32_t msw, lsw; VAL [\old(x)=4294967306, x=4294967306] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967306, lsw=4294967297, msw=2146435073, x=4294967306] [L38-L39] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=2146435073, x=4294967306] [L41-L42] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=2146435073, x=4294967306] [L45-L46] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L49] return 0; VAL [\old(x)=4294967306, \result=0, x=4294967306] [L54] RET, EXPR __fpclassify_double(x) VAL [x=4294967306, y=0] [L54] COND TRUE __fpclassify_double(x) == 0 [L55] return y; VAL [\result=0, x=4294967306] [L83] RET, EXPR fmax_double(x, y) [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0] [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L87] reach_error() VAL [res=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 474 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 148 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=2, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 00:50:18,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -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 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:50:20,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:50:20,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 00:50:20,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:50:20,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:50:20,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:50:20,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:50:20,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:50:20,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:50:20,468 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:50:20,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:50:20,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:50:20,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:50:20,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:50:20,469 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:50:20,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:50:20,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:50:20,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:50:20,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:50:20,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:50:20,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:50:20,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:50:20,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:50:20,476 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 00:50:20,476 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 00:50:20,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:50:20,476 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 00:50:20,476 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:50:20,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:50:20,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:50:20,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:50:20,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:50:20,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:50:20,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:50:20,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:50:20,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:50:20,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:50:20,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:50:20,478 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 00:50:20,478 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 00:50:20,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:50:20,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:50:20,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:50:20,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:50:20,482 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 00:50:20,482 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 -> 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e [2024-10-14 00:50:20,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:50:20,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:50:20,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:50:20,806 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:50:20,806 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:50:20,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2024-10-14 00:50:22,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:50:22,353 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:50:22,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2024-10-14 00:50:22,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf8a640d/04ea9b6bc06349798097659138573da9/FLAG7ce824ac7 [2024-10-14 00:50:22,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf8a640d/04ea9b6bc06349798097659138573da9 [2024-10-14 00:50:22,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:50:22,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:50:22,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:50:22,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:50:22,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:50:22,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49206ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22, skipping insertion in model container [2024-10-14 00:50:22,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:50:22,547 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/float-newlib/double_req_bl_1252a.c[2154,2167] [2024-10-14 00:50:22,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:50:22,562 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:50:22,588 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/float-newlib/double_req_bl_1252a.c[2154,2167] [2024-10-14 00:50:22,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:50:22,605 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:50:22,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22 WrapperNode [2024-10-14 00:50:22,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:50:22,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:50:22,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:50:22,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:50:22,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,644 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-10-14 00:50:22,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:50:22,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:50:22,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:50:22,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:50:22,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,670 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-10-14 00:50:22,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:50:22,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:50:22,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:50:22,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:50:22,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (1/1) ... [2024-10-14 00:50:22,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:50:22,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:50:22,735 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 00:50:22,738 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 00:50:22,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:50:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 00:50:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 00:50:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-14 00:50:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 00:50:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 00:50:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 00:50:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 00:50:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-14 00:50:22,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-14 00:50:22,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 00:50:22,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 00:50:22,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 00:50:22,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:50:22,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:50:22,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 00:50:22,832 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:50:22,834 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:50:23,017 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 00:50:23,018 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:50:23,054 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:50:23,055 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 00:50:23,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:23 BoogieIcfgContainer [2024-10-14 00:50:23,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:50:23,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:50:23,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:50:23,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:50:23,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:50:22" (1/3) ... [2024-10-14 00:50:23,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40de8538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:50:23, skipping insertion in model container [2024-10-14 00:50:23,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:22" (2/3) ... [2024-10-14 00:50:23,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40de8538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:50:23, skipping insertion in model container [2024-10-14 00:50:23,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:23" (3/3) ... [2024-10-14 00:50:23,071 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2024-10-14 00:50:23,096 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:50:23,099 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:50:23,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:50:23,177 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;@7f2a9c22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:50:23,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:50:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 00:50:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 00:50:23,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:23,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:23,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:23,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:23,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1087397120, now seen corresponding path program 1 times [2024-10-14 00:50:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:23,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031114249] [2024-10-14 00:50:23,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:23,209 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 00:50:23,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:23,214 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 00:50:23,226 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 00:50:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:23,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 00:50:23,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:23,347 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 00:50:23,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:23,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:23,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031114249] [2024-10-14 00:50:23,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031114249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:23,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:23,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:50:23,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466718019] [2024-10-14 00:50:23,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:23,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 00:50:23,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:23,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 00:50:23,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:50:23,381 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:23,404 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2024-10-14 00:50:23,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 00:50:23,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-14 00:50:23,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:23,414 INFO L225 Difference]: With dead ends: 46 [2024-10-14 00:50:23,414 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 00:50:23,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:50:23,421 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:23,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 00:50:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 00:50:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 00:50:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-14 00:50:23,457 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2024-10-14 00:50:23,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:23,457 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-14 00:50:23,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-10-14 00:50:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 00:50:23,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:23,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:23,464 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 00:50:23,664 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 00:50:23,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:23,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:23,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1335499105, now seen corresponding path program 1 times [2024-10-14 00:50:23,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:23,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715102667] [2024-10-14 00:50:23,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:23,669 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 00:50:23,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:23,673 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 00:50:23,674 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 00:50:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:23,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:50:23,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:23,777 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 00:50:23,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:23,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:23,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715102667] [2024-10-14 00:50:23,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715102667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:23,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:23,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:50:23,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523100297] [2024-10-14 00:50:23,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:23,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:50:23,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:23,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:50:23,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:23,781 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:23,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:23,804 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2024-10-14 00:50:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:50:23,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-14 00:50:23,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:23,806 INFO L225 Difference]: With dead ends: 33 [2024-10-14 00:50:23,806 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 00:50:23,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:23,812 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:23,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 00:50:23,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-14 00:50:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 00:50:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-10-14 00:50:23,822 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2024-10-14 00:50:23,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:23,822 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-10-14 00:50:23,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:23,822 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-10-14 00:50:23,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 00:50:23,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:23,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:23,833 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 00:50:24,027 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 00:50:24,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:24,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash -710780355, now seen corresponding path program 1 times [2024-10-14 00:50:24,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:24,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027547012] [2024-10-14 00:50:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:24,031 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 00:50:24,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:24,041 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 00:50:24,042 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 00:50:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:24,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 00:50:24,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:24,325 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 00:50:24,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:24,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027547012] [2024-10-14 00:50:24,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027547012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:24,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:24,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 00:50:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385396573] [2024-10-14 00:50:24,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:24,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 00:50:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:24,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 00:50:24,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 00:50:24,328 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:24,692 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2024-10-14 00:50:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 00:50:24,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-14 00:50:24,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:24,694 INFO L225 Difference]: With dead ends: 50 [2024-10-14 00:50:24,694 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 00:50:24,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 00:50:24,695 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:24,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 00:50:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 00:50:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-10-14 00:50:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 00:50:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-14 00:50:24,706 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-10-14 00:50:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:24,707 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-14 00:50:24,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-14 00:50:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 00:50:24,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:24,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:24,716 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 00:50:24,909 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 00:50:24,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:24,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash -143061541, now seen corresponding path program 1 times [2024-10-14 00:50:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:24,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216383075] [2024-10-14 00:50:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:24,912 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 00:50:24,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:24,915 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 00:50:24,919 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 00:50:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:24,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:50:24,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:24,978 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 00:50:24,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:24,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:24,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216383075] [2024-10-14 00:50:24,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216383075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:24,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:24,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:50:24,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654216472] [2024-10-14 00:50:24,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:24,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:50:24,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:24,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:50:24,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:24,981 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:25,008 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-10-14 00:50:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:50:25,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-14 00:50:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:25,009 INFO L225 Difference]: With dead ends: 38 [2024-10-14 00:50:25,009 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 00:50:25,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:25,011 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:25,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 00:50:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-10-14 00:50:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 00:50:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-14 00:50:25,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 15 [2024-10-14 00:50:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:25,017 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-14 00:50:25,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-14 00:50:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 00:50:25,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:25,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:25,025 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 00:50:25,222 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 00:50:25,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:25,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1342340743, now seen corresponding path program 1 times [2024-10-14 00:50:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:25,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357523706] [2024-10-14 00:50:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:25,223 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 00:50:25,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:25,225 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 00:50:25,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 00:50:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:25,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 00:50:25,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:25,445 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 00:50:25,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:25,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:25,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357523706] [2024-10-14 00:50:25,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357523706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:25,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:25,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 00:50:25,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544993016] [2024-10-14 00:50:25,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:25,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 00:50:25,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 00:50:25,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 00:50:25,447 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:25,733 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-10-14 00:50:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 00:50:25,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-14 00:50:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:25,739 INFO L225 Difference]: With dead ends: 50 [2024-10-14 00:50:25,739 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 00:50:25,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 00:50:25,740 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:25,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 00:50:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 00:50:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-14 00:50:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 00:50:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-14 00:50:25,749 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2024-10-14 00:50:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:25,754 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-14 00:50:25,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 00:50:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-14 00:50:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 00:50:25,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:25,755 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:25,760 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 (6)] Ended with exit code 0 [2024-10-14 00:50:25,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 00:50:25,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:25,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1234767684, now seen corresponding path program 1 times [2024-10-14 00:50:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:25,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99157710] [2024-10-14 00:50:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:25,957 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 00:50:25,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:25,959 INFO L229 MonitoredProcess]: Starting monitored process 7 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 00:50:25,960 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 (7)] Waiting until timeout for monitored process [2024-10-14 00:50:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:26,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:50:26,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 00:50:26,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:26,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99157710] [2024-10-14 00:50:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99157710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:26,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:26,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:50:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332516835] [2024-10-14 00:50:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:26,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:50:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:26,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:50:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:26,045 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:26,266 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-10-14 00:50:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:50:26,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-14 00:50:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:26,268 INFO L225 Difference]: With dead ends: 35 [2024-10-14 00:50:26,268 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 00:50:26,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:26,269 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:26,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 00:50:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 00:50:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 00:50:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 00:50:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-10-14 00:50:26,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 21 [2024-10-14 00:50:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:26,278 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-10-14 00:50:26,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-10-14 00:50:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 00:50:26,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:26,279 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:26,288 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 (7)] Ended with exit code 0 [2024-10-14 00:50:26,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 00:50:26,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:26,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1232920642, now seen corresponding path program 1 times [2024-10-14 00:50:26,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:26,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358176162] [2024-10-14 00:50:26,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:26,485 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 00:50:26,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:26,488 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 00:50:26,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 00:50:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:26,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 00:50:26,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 00:50:26,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:26,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:26,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358176162] [2024-10-14 00:50:26,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358176162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:26,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:26,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:50:26,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033120519] [2024-10-14 00:50:26,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:26,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:50:26,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:26,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:50:26,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:26,588 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:26,619 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-10-14 00:50:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:50:26,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-14 00:50:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:26,622 INFO L225 Difference]: With dead ends: 32 [2024-10-14 00:50:26,622 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 00:50:26,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:26,623 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:26,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 00:50:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 00:50:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 00:50:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-14 00:50:26,649 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 21 [2024-10-14 00:50:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:26,649 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-14 00:50:26,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-14 00:50:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 00:50:26,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:26,651 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:26,656 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 (8)] Ended with exit code 0 [2024-10-14 00:50:26,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 00:50:26,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:26,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:26,855 INFO L85 PathProgramCache]: Analyzing trace with hash 527910856, now seen corresponding path program 1 times [2024-10-14 00:50:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:26,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035631463] [2024-10-14 00:50:26,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:26,856 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 00:50:26,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:26,857 INFO L229 MonitoredProcess]: Starting monitored process 9 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 00:50:26,861 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 (9)] Waiting until timeout for monitored process [2024-10-14 00:50:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:26,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 00:50:26,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 00:50:27,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:27,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035631463] [2024-10-14 00:50:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035631463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:27,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:27,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 00:50:27,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851851162] [2024-10-14 00:50:27,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:27,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 00:50:27,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:27,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 00:50:27,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 00:50:27,018 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:27,199 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-10-14 00:50:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 00:50:27,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-14 00:50:27,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:27,200 INFO L225 Difference]: With dead ends: 42 [2024-10-14 00:50:27,200 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 00:50:27,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 00:50:27,201 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:27,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 62 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 00:50:27,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 00:50:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 00:50:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 00:50:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-14 00:50:27,210 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-10-14 00:50:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:27,210 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-14 00:50:27,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-10-14 00:50:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 00:50:27,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:27,210 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:27,219 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 (9)] Ended with exit code 0 [2024-10-14 00:50:27,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 00:50:27,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:27,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:27,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2012644792, now seen corresponding path program 1 times [2024-10-14 00:50:27,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:27,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822419531] [2024-10-14 00:50:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:27,412 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 00:50:27,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:27,414 INFO L229 MonitoredProcess]: Starting monitored process 10 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 00:50:27,415 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 (10)] Waiting until timeout for monitored process [2024-10-14 00:50:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:27,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:50:27,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 00:50:27,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:27,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:27,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822419531] [2024-10-14 00:50:27,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822419531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:27,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:27,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:50:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457938848] [2024-10-14 00:50:27,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:27,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:50:27,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:27,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:50:27,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:27,481 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:27,780 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-14 00:50:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:50:27,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-14 00:50:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:27,781 INFO L225 Difference]: With dead ends: 38 [2024-10-14 00:50:27,781 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 00:50:27,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:27,782 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:27,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 00:50:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 00:50:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-10-14 00:50:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 00:50:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-14 00:50:27,786 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 23 [2024-10-14 00:50:27,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:27,786 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-14 00:50:27,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-14 00:50:27,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 00:50:27,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:27,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:27,792 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 (10)] Ended with exit code 0 [2024-10-14 00:50:27,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 00:50:27,991 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:27,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:27,991 INFO L85 PathProgramCache]: Analyzing trace with hash -823936700, now seen corresponding path program 1 times [2024-10-14 00:50:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:27,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586151884] [2024-10-14 00:50:27,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:27,992 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 00:50:27,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:27,995 INFO L229 MonitoredProcess]: Starting monitored process 11 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 00:50:27,996 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 (11)] Waiting until timeout for monitored process [2024-10-14 00:50:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:28,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 00:50:28,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 00:50:28,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:28,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:28,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586151884] [2024-10-14 00:50:28,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586151884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:28,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:28,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 00:50:28,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354944090] [2024-10-14 00:50:28,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:28,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 00:50:28,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:28,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 00:50:28,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 00:50:28,131 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:28,311 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-10-14 00:50:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 00:50:28,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-14 00:50:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:28,312 INFO L225 Difference]: With dead ends: 35 [2024-10-14 00:50:28,312 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 00:50:28,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 00:50:28,313 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 49 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:28,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 49 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 00:50:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 00:50:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-14 00:50:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 00:50:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-14 00:50:28,321 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 24 [2024-10-14 00:50:28,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:28,321 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-14 00:50:28,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-14 00:50:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 00:50:28,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:28,322 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:28,330 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 (11)] Ended with exit code 0 [2024-10-14 00:50:28,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 00:50:28,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:28,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 118740037, now seen corresponding path program 1 times [2024-10-14 00:50:28,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:28,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961207013] [2024-10-14 00:50:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:28,524 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 00:50:28,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:28,526 INFO L229 MonitoredProcess]: Starting monitored process 12 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 00:50:28,527 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 (12)] Waiting until timeout for monitored process [2024-10-14 00:50:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:28,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 00:50:28,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 00:50:28,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:28,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:28,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961207013] [2024-10-14 00:50:28,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961207013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:28,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:28,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 00:50:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101117326] [2024-10-14 00:50:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:28,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 00:50:28,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:28,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 00:50:28,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 00:50:28,665 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:28,710 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-10-14 00:50:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 00:50:28,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-14 00:50:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:28,711 INFO L225 Difference]: With dead ends: 21 [2024-10-14 00:50:28,711 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 00:50:28,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 00:50:28,715 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:28,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 93 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 00:50:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 00:50:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 00:50:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 00:50:28,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-10-14 00:50:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:28,716 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 00:50:28,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 00:50:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 00:50:28,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 00:50:28,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 00:50:28,723 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 (12)] Ended with exit code 0 [2024-10-14 00:50:28,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 00:50:28,929 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:28,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 00:50:29,149 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 00:50:29,163 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~64 [2024-10-14 00:50:29,208 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 00:50:29,208 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 00:50:29,209 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 00:50:29,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:50:29 BoogieIcfgContainer [2024-10-14 00:50:29,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 00:50:29,211 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 00:50:29,211 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 00:50:29,211 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 00:50:29,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:23" (3/4) ... [2024-10-14 00:50:29,217 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 00:50:29,219 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-10-14 00:50:29,225 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-14 00:50:29,226 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-14 00:50:29,227 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 00:50:29,227 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 00:50:29,246 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2024-10-14 00:50:29,256 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2024-10-14 00:50:29,289 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 00:50:29,289 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 00:50:29,289 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 00:50:29,290 INFO L158 Benchmark]: Toolchain (without parser) took 6909.92ms. Allocated memory was 75.5MB in the beginning and 102.8MB in the end (delta: 27.3MB). Free memory was 49.3MB in the beginning and 71.9MB in the end (delta: -22.5MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2024-10-14 00:50:29,291 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 52.4MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:50:29,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.85ms. Allocated memory is still 75.5MB. Free memory was 49.1MB in the beginning and 36.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 00:50:29,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.69ms. Allocated memory is still 75.5MB. Free memory was 36.2MB in the beginning and 34.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:50:29,291 INFO L158 Benchmark]: Boogie Preprocessor took 45.52ms. Allocated memory is still 75.5MB. Free memory was 34.7MB in the beginning and 32.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:50:29,292 INFO L158 Benchmark]: RCFGBuilder took 363.34ms. Allocated memory is still 75.5MB. Free memory was 32.1MB in the beginning and 39.2MB in the end (delta: -7.1MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2024-10-14 00:50:29,292 INFO L158 Benchmark]: TraceAbstraction took 6153.44ms. Allocated memory was 75.5MB in the beginning and 102.8MB in the end (delta: 27.3MB). Free memory was 38.5MB in the beginning and 77.0MB in the end (delta: -38.5MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-10-14 00:50:29,292 INFO L158 Benchmark]: Witness Printer took 78.95ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 71.9MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:50:29,293 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.14ms. Allocated memory is still 52.4MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.85ms. Allocated memory is still 75.5MB. Free memory was 49.1MB in the beginning and 36.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.69ms. Allocated memory is still 75.5MB. Free memory was 36.2MB in the beginning and 34.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.52ms. Allocated memory is still 75.5MB. Free memory was 34.7MB in the beginning and 32.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 363.34ms. Allocated memory is still 75.5MB. Free memory was 32.1MB in the beginning and 39.2MB in the end (delta: -7.1MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6153.44ms. Allocated memory was 75.5MB in the beginning and 102.8MB in the end (delta: 27.3MB). Free memory was 38.5MB in the beginning and 77.0MB in the end (delta: -38.5MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 78.95ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 71.9MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 87]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 380 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 231 mSDtfsCounter, 380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=7, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 194 ConstructedInterpolants, 26 QuantifiedInterpolants, 825 SizeOfPredicates, 17 NumberOfNonLiveVariables, 734 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 36/36 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (\old(x) == x) RESULT: Ultimate proved your program to be correct! [2024-10-14 00:50:29,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE