./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.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 f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 12:33:48,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:33:48,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 12:33:48,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:33:48,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:33:48,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:33:48,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:33:48,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:33:48,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:33:48,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:33:48,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:33:48,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:33:48,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:33:48,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:33:48,120 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:33:48,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:33:48,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:33:48,121 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:33:48,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:33:48,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:33:48,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:33:48,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:33:48,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:33:48,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:33:48,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:33:48,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:33:48,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:33:48,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:33:48,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:33:48,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:33:48,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:33:48,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:33:48,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:33:48,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:33:48,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:33:48,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:33:48,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:33:48,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:33:48,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:33:48,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:33:48,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:33:48,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:33:48,128 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 -> f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 [2024-11-08 12:33:48,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:33:48,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:33:48,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:33:48,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:33:48,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:33:48,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-08 12:33:49,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:33:49,862 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:33:49,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-08 12:33:49,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/194307641/6089342aba984b43bc14e83550102d99/FLAGac844e148 [2024-11-08 12:33:50,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/194307641/6089342aba984b43bc14e83550102d99 [2024-11-08 12:33:50,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:33:50,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:33:50,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:33:50,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:33:50,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:33:50,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8610afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50, skipping insertion in model container [2024-11-08 12:33:50,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:33:50,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-08 12:33:50,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:33:50,440 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:33:50,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-08 12:33:50,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:33:50,481 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:33:50,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50 WrapperNode [2024-11-08 12:33:50,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:33:50,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:33:50,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:33:50,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:33:50,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,524 INFO L138 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-08 12:33:50,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:33:50,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:33:50,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:33:50,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:33:50,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,554 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [3, 2, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 2 writes are split as follows [1, 0, 1]. [2024-11-08 12:33:50,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:33:50,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:33:50,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:33:50,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:33:50,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (1/1) ... [2024-11-08 12:33:50,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:33:50,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:33:50,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 12:33:50,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 12:33:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:33:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 12:33:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 12:33:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 12:33:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 12:33:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-08 12:33:50,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-08 12:33:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 12:33:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 12:33:50,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 12:33:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:33:50,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:33:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 12:33:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 12:33:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 12:33:50,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 12:33:50,739 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:33:50,741 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:33:50,911 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-08 12:33:50,912 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:33:50,923 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:33:50,923 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-08 12:33:50,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:50 BoogieIcfgContainer [2024-11-08 12:33:50,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:33:50,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:33:50,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:33:50,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:33:50,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:33:50" (1/3) ... [2024-11-08 12:33:50,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51eff62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:33:50, skipping insertion in model container [2024-11-08 12:33:50,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:50" (2/3) ... [2024-11-08 12:33:50,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51eff62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:33:50, skipping insertion in model container [2024-11-08 12:33:50,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:50" (3/3) ... [2024-11-08 12:33:50,930 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2024-11-08 12:33:50,942 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:33:50,943 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:33:50,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:33:50,992 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;@62bb22f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:33:50,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:33:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 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-11-08 12:33:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 12:33:51,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:51,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:51,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:51,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:51,007 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-08 12:33:51,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:33:51,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207654261] [2024-11-08 12:33:51,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:51,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:33:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 12:33:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:51,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:33:51,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207654261] [2024-11-08 12:33:51,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207654261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:51,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:51,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:33:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975251473] [2024-11-08 12:33:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:51,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:33:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:33:51,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:33:51,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:33:51,201 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 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 4.0) internal successors, (12), 2 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-11-08 12:33:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:51,231 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-08 12:33:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:33:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-11-08 12:33:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:51,240 INFO L225 Difference]: With dead ends: 55 [2024-11-08 12:33:51,240 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 12:33:51,243 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-11-08 12:33:51,245 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:51,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:33:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 12:33:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-08 12:33:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-11-08 12:33:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-08 12:33:51,277 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-08 12:33:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:51,278 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-08 12:33:51,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-11-08 12:33:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-08 12:33:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 12:33:51,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:51,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:51,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:33:51,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:51,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-08 12:33:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:33:51,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873366876] [2024-11-08 12:33:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:51,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:33:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 12:33:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:51,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:33:51,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873366876] [2024-11-08 12:33:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873366876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:51,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:51,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:33:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908549103] [2024-11-08 12:33:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:51,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:33:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:33:51,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:33:51,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:33:51,485 INFO L87 Difference]: Start difference. First operand 26 states and 33 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-11-08 12:33:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:51,521 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-08 12:33:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:33:51,522 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-11-08 12:33:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:51,524 INFO L225 Difference]: With dead ends: 39 [2024-11-08 12:33:51,524 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 12:33:51,525 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-11-08 12:33:51,526 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:51,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:33:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 12:33:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-08 12:33:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-11-08 12:33:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-08 12:33:51,532 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-08 12:33:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:51,532 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-08 12:33:51,533 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-11-08 12:33:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-08 12:33:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 12:33:51,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:51,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:51,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:33:51,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:51,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-08 12:33:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:33:51,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384861828] [2024-11-08 12:33:51,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:51,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:33:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:51,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 12:33:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:51,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:33:51,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384861828] [2024-11-08 12:33:51,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384861828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:51,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:51,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:33:51,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328389448] [2024-11-08 12:33:51,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:51,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:33:51,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:33:51,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:33:51,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:33:51,737 INFO L87 Difference]: Start difference. First operand 30 states and 38 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-11-08 12:33:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:51,761 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-08 12:33:51,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:33:51,762 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-11-08 12:33:51,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:51,762 INFO L225 Difference]: With dead ends: 43 [2024-11-08 12:33:51,762 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 12:33:51,763 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-11-08 12:33:51,764 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:51,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:33:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 12:33:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-08 12:33:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-11-08 12:33:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-08 12:33:51,768 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-08 12:33:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:51,769 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-08 12:33:51,769 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-11-08 12:33:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-08 12:33:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 12:33:51,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:51,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:51,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 12:33:51,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:51,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:51,771 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-08 12:33:51,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:33:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672437553] [2024-11-08 12:33:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:51,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:33:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:51,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 12:33:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:51,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:33:51,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672437553] [2024-11-08 12:33:51,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672437553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:51,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:51,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:33:51,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407419752] [2024-11-08 12:33:51,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:51,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:33:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:33:51,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:33:51,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:33:51,898 INFO L87 Difference]: Start difference. First operand 30 states and 38 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-11-08 12:33:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:51,932 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-08 12:33:51,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:33:51,933 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-11-08 12:33:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:51,933 INFO L225 Difference]: With dead ends: 43 [2024-11-08 12:33:51,933 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 12:33:51,934 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-11-08 12:33:51,935 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:51,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:33:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 12:33:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-08 12:33:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-11-08 12:33:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-08 12:33:51,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-08 12:33:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:51,940 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-08 12:33:51,940 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-11-08 12:33:51,940 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-08 12:33:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 12:33:51,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:51,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:51,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 12:33:51,941 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:51,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-08 12:33:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:33:51,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702630064] [2024-11-08 12:33:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:51,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:33:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 12:33:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:52,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:33:52,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702630064] [2024-11-08 12:33:52,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702630064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:52,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:52,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:33:52,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442606542] [2024-11-08 12:33:52,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:52,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:33:52,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:33:52,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:33:52,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:33:52,030 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-11-08 12:33:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:52,062 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-08 12:33:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:33:52,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2024-11-08 12:33:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:52,064 INFO L225 Difference]: With dead ends: 43 [2024-11-08 12:33:52,064 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 12:33:52,064 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-11-08 12:33:52,065 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:52,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:33:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 12:33:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-08 12:33:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-11-08 12:33:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-08 12:33:52,073 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-08 12:33:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:52,075 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-08 12:33:52,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-11-08 12:33:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-08 12:33:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 12:33:52,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:52,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:52,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 12:33:52,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:52,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-08 12:33:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:33:52,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636904951] [2024-11-08 12:33:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:52,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:33:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:33:52,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:33:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:33:52,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:33:52,124 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:33:52,125 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 12:33:52,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 12:33:52,131 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 12:33:52,149 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:33:52,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 12:33:52 BoogieIcfgContainer [2024-11-08 12:33:52,151 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 12:33:52,152 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 12:33:52,152 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 12:33:52,152 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 12:33:52,153 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:50" (3/4) ... [2024-11-08 12:33:52,154 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 12:33:52,155 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 12:33:52,156 INFO L158 Benchmark]: Toolchain (without parser) took 1940.11ms. Allocated memory is still 169.9MB. Free memory was 139.7MB in the beginning and 87.8MB in the end (delta: 51.9MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2024-11-08 12:33:52,156 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:33:52,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.53ms. Allocated memory is still 169.9MB. Free memory was 139.0MB in the beginning and 126.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 12:33:52,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.52ms. Allocated memory is still 169.9MB. Free memory was 125.7MB in the beginning and 124.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:33:52,157 INFO L158 Benchmark]: Boogie Preprocessor took 42.04ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:33:52,157 INFO L158 Benchmark]: RCFGBuilder took 354.47ms. Allocated memory is still 169.9MB. Free memory was 122.2MB in the beginning and 107.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 12:33:52,157 INFO L158 Benchmark]: TraceAbstraction took 1226.57ms. Allocated memory is still 169.9MB. Free memory was 106.8MB in the beginning and 87.8MB in the end (delta: 19.0MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-11-08 12:33:52,158 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 169.9MB. Free memory was 87.8MB in the beginning and 87.8MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:33:52,159 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.16ms. Allocated memory is still 169.9MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.53ms. Allocated memory is still 169.9MB. Free memory was 139.0MB in the beginning and 126.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.52ms. Allocated memory is still 169.9MB. Free memory was 125.7MB in the beginning and 124.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.04ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.47ms. Allocated memory is still 169.9MB. Free memory was 122.2MB in the beginning and 107.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1226.57ms. Allocated memory is still 169.9MB. Free memory was 106.8MB in the beginning and 87.8MB in the end (delta: 19.0MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 169.9MB. Free memory was 87.8MB in the beginning and 87.8MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 82]: 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 81, overapproximation of someUnaryDOUBLEoperation at line 77. Possible FailurePath: [L76] double x = 0.0; [L77] double y = -0.0; [L78] CALL, EXPR fmin_double(x, y) [L48] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L30-L31] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L33-L34] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L36-L37] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L40-L41] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L44] return 0; VAL [\old(x)=0, \result=0, x=0] [L48] RET, EXPR __fpclassify_double(x) VAL [x=0, y=4294967306] [L48] COND TRUE __fpclassify_double(x) == 0 [L49] return y; VAL [\result=4294967306, x=0] [L78] RET, EXPR fmin_double(x, y) [L78] double res = fmin_double(x, y); [L81] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=4294967306] [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L82] reach_error() VAL [res=4294967306] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, 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, 541 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 170 mSDtfsCounter, 91 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=30occurred 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.6s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 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-11-08 12:33:52,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.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 f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 12:33:54,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:33:54,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 12:33:54,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:33:54,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:33:54,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:33:54,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:33:54,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:33:54,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:33:54,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:33:54,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:33:54,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:33:54,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:33:54,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:33:54,250 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:33:54,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:33:54,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:33:54,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:33:54,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:33:54,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:33:54,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:33:54,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:33:54,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:33:54,254 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 12:33:54,254 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 12:33:54,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:33:54,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 12:33:54,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:33:54,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:33:54,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:33:54,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:33:54,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:33:54,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:33:54,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:33:54,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:33:54,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:33:54,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:33:54,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:33:54,267 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 12:33:54,267 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 12:33:54,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:33:54,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:33:54,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:33:54,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:33:54,268 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 -> f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 [2024-11-08 12:33:54,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:33:54,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:33:54,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:33:54,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:33:54,514 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:33:54,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-08 12:33:55,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:33:56,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:33:56,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-08 12:33:56,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a08edab1/788a790616334da1b7ed8b206b70320a/FLAG8e66e6c3e [2024-11-08 12:33:56,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a08edab1/788a790616334da1b7ed8b206b70320a [2024-11-08 12:33:56,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:33:56,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:33:56,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:33:56,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:33:56,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:33:56,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28597815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56, skipping insertion in model container [2024-11-08 12:33:56,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:33:56,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-08 12:33:56,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:33:56,291 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:33:56,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-08 12:33:56,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:33:56,340 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:33:56,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56 WrapperNode [2024-11-08 12:33:56,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:33:56,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:33:56,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:33:56,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:33:56,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,382 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-08 12:33:56,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:33:56,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:33:56,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:33:56,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:33:56,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,414 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-11-08 12:33:56,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:33:56,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:33:56,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:33:56,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:33:56,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (1/1) ... [2024-11-08 12:33:56,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:33:56,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:33:56,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 12:33:56,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 12:33:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:33:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 12:33:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 12:33:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 12:33:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 12:33:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 12:33:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 12:33:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 12:33:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-08 12:33:56,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-08 12:33:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 12:33:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 12:33:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 12:33:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:33:56,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:33:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 12:33:56,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:33:56,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:33:56,852 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-08 12:33:56,852 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:33:56,862 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:33:56,862 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-08 12:33:56,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:56 BoogieIcfgContainer [2024-11-08 12:33:56,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:33:56,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:33:56,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:33:56,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:33:56,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:33:56" (1/3) ... [2024-11-08 12:33:56,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22637a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:33:56, skipping insertion in model container [2024-11-08 12:33:56,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:56" (2/3) ... [2024-11-08 12:33:56,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22637a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:33:56, skipping insertion in model container [2024-11-08 12:33:56,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:56" (3/3) ... [2024-11-08 12:33:56,870 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2024-11-08 12:33:56,884 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:33:56,884 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:33:56,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:33:56,942 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;@56502da9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:33:56,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:33:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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-11-08 12:33:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 12:33:56,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:56,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:56,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:56,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-08 12:33:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:33:56,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601606135] [2024-11-08 12:33:56,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:56,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:33:56,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:33:56,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 12:33:56,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 12:33:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:57,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 12:33:57,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:33:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:57,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:33:57,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:33:57,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601606135] [2024-11-08 12:33:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601606135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:57,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:57,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:33:57,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074093454] [2024-11-08 12:33:57,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:57,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:33:57,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:33:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:33:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:33:57,105 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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.5) 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-11-08 12:33:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:57,132 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-08 12:33:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:33:57,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) 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-11-08 12:33:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:57,140 INFO L225 Difference]: With dead ends: 51 [2024-11-08 12:33:57,141 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 12:33:57,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:33:57,151 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:57,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:33:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 12:33:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-08 12:33:57,196 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-11-08 12:33:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-08 12:33:57,199 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-08 12:33:57,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:57,199 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-08 12:33:57,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) 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-11-08 12:33:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-08 12:33:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 12:33:57,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:57,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:57,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 12:33:57,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:33:57,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:57,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:57,404 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-08 12:33:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:33:57,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571984582] [2024-11-08 12:33:57,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:57,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:33:57,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:33:57,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 12:33:57,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 12:33:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:57,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:33:57,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:33:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:57,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:33:57,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:33:57,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571984582] [2024-11-08 12:33:57,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571984582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:57,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:57,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:33:57,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362916634] [2024-11-08 12:33:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:57,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:33:57,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:33:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:33:57,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:33:57,539 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-11-08 12:33:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:57,577 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-08 12:33:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:33:57,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-11-08 12:33:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:57,579 INFO L225 Difference]: With dead ends: 36 [2024-11-08 12:33:57,580 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 12:33:57,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-11-08 12:33:57,581 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:57,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:33:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 12:33:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 12:33:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-11-08 12:33:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-08 12:33:57,593 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-08 12:33:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:57,594 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-08 12:33:57,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-11-08 12:33:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-08 12:33:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 12:33:57,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:57,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:57,599 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-11-08 12:33:57,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:33:57,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:57,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:57,801 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-08 12:33:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:33:57,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72517407] [2024-11-08 12:33:57,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:57,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:33:57,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:33:57,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 12:33:57,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 12:33:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:57,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 12:33:57,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:33:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:58,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:33:58,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:33:58,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72517407] [2024-11-08 12:33:58,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72517407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:58,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:58,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 12:33:58,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387141379] [2024-11-08 12:33:58,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:58,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:33:58,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:33:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:33:58,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:33:58,101 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-11-08 12:33:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:58,410 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2024-11-08 12:33:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:33:58,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-11-08 12:33:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:58,411 INFO L225 Difference]: With dead ends: 53 [2024-11-08 12:33:58,411 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 12:33:58,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 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-11-08 12:33:58,412 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:58,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 12:33:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 12:33:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-08 12:33:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-11-08 12:33:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-08 12:33:58,418 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2024-11-08 12:33:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:58,418 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-08 12:33:58,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-11-08 12:33:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-08 12:33:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 12:33:58,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:58,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:58,424 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-11-08 12:33:58,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:33:58,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:58,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1221479789, now seen corresponding path program 1 times [2024-11-08 12:33:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:33:58,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084853260] [2024-11-08 12:33:58,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:58,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:33:58,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:33:58,630 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 12:33:58,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 12:33:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:58,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:33:58,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:33:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:58,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:33:58,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:33:58,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084853260] [2024-11-08 12:33:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084853260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:58,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:33:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693908671] [2024-11-08 12:33:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:58,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:33:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:33:58,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:33:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:33:58,705 INFO L87 Difference]: Start difference. First operand 29 states and 37 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, (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-11-08 12:33:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:58,723 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-08 12:33:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:33:58,724 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, (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-11-08 12:33:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:58,724 INFO L225 Difference]: With dead ends: 41 [2024-11-08 12:33:58,724 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 12:33:58,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-11-08 12:33:58,725 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:58,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:33:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 12:33:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-08 12:33:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-11-08 12:33:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-08 12:33:58,730 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-11-08 12:33:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:58,730 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-08 12:33:58,730 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, (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-11-08 12:33:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-08 12:33:58,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 12:33:58,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:58,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:58,736 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-11-08 12:33:58,935 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-11-08 12:33:58,935 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:58,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:58,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1991232473, now seen corresponding path program 1 times [2024-11-08 12:33:58,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:33:58,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326064009] [2024-11-08 12:33:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:58,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:33:58,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:33:58,939 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-11-08 12:33:58,947 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-11-08 12:33:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:59,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 12:33:59,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:33:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:59,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:33:59,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:33:59,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326064009] [2024-11-08 12:33:59,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326064009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:59,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:59,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 12:33:59,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798018146] [2024-11-08 12:33:59,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:59,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:33:59,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:33:59,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:33:59,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:33:59,122 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-11-08 12:33:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:59,310 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-11-08 12:33:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:33:59,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-11-08 12:33:59,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:59,312 INFO L225 Difference]: With dead ends: 53 [2024-11-08 12:33:59,312 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 12:33:59,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 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-11-08 12:33:59,313 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:59,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:33:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 12:33:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-08 12:33:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 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), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 12:33:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-08 12:33:59,317 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2024-11-08 12:33:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:59,318 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-08 12:33:59,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-11-08 12:33:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-08 12:33:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 12:33:59,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:59,319 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:59,322 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-11-08 12:33:59,522 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-11-08 12:33:59,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:59,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-08 12:33:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:33:59,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140882798] [2024-11-08 12:33:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:59,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-11-08 12:33:59,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:33:59,526 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-11-08 12:33:59,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 (7)] Waiting until timeout for monitored process [2024-11-08 12:33:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:59,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:33:59,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:33:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 12:33:59,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:33:59,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:33:59,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140882798] [2024-11-08 12:33:59,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140882798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:59,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:59,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:33:59,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768666837] [2024-11-08 12:33:59,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:59,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:33:59,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:33:59,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:33:59,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:33:59,609 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-11-08 12:33:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:59,632 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-08 12:33:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:33:59,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-11-08 12:33:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:59,633 INFO L225 Difference]: With dead ends: 38 [2024-11-08 12:33:59,633 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 12:33:59,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-11-08 12:33:59,634 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:59,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:33:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 12:33:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-08 12:33:59,644 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-11-08 12:33:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-08 12:33:59,645 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 22 [2024-11-08 12:33:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:59,645 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-08 12:33:59,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-11-08 12:33:59,645 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-08 12:33:59,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 12:33:59,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:59,646 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:59,652 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-11-08 12:33:59,847 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-11-08 12:33:59,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:59,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:59,849 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-08 12:33:59,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:33:59,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5995471] [2024-11-08 12:33:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:59,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:33:59,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:33:59,853 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-11-08 12:33:59,854 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-11-08 12:33:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:59,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 12:33:59,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:33:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 12:33:59,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:33:59,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:33:59,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5995471] [2024-11-08 12:33:59,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5995471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:59,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:59,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:33:59,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427201043] [2024-11-08 12:33:59,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:59,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:33:59,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:33:59,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:33:59,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:33:59,960 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-11-08 12:33:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:59,996 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-08 12:33:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:33:59,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 22 [2024-11-08 12:33:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:59,998 INFO L225 Difference]: With dead ends: 34 [2024-11-08 12:33:59,999 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 12:34:00,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-11-08 12:34:00,000 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:34:00,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:34:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 12:34:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-08 12:34:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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-11-08 12:34:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-08 12:34:00,012 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2024-11-08 12:34:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:34:00,013 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-08 12:34:00,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-11-08 12:34:00,013 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-08 12:34:00,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 12:34:00,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:34:00,015 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-11-08 12:34:00,022 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-11-08 12:34:00,219 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-11-08 12:34:00,220 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:34:00,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:34:00,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-08 12:34:00,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:34:00,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209927043] [2024-11-08 12:34:00,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:34:00,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:34:00,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:34:00,224 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-11-08 12:34:00,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 (9)] Waiting until timeout for monitored process [2024-11-08 12:34:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:34:00,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 12:34:00,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:34:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:34:00,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:34:00,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:34:00,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209927043] [2024-11-08 12:34:00,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209927043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:34:00,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:34:00,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 12:34:00,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485819797] [2024-11-08 12:34:00,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:34:00,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:34:00,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:34:00,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:34:00,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:34:00,451 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-11-08 12:34:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:34:00,595 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-08 12:34:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:34:00,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-11-08 12:34:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:34:00,596 INFO L225 Difference]: With dead ends: 45 [2024-11-08 12:34:00,596 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 12:34:00,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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-11-08 12:34:00,597 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:34:00,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:34:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 12:34:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-08 12:34:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 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-11-08 12:34:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-08 12:34:00,601 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 23 [2024-11-08 12:34:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:34:00,601 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-08 12:34:00,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-11-08 12:34:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-08 12:34:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 12:34:00,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:34:00,602 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-11-08 12:34:00,607 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-11-08 12:34:00,802 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-11-08 12:34:00,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:34:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:34:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash 178525002, now seen corresponding path program 1 times [2024-11-08 12:34:00,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:34:00,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639607636] [2024-11-08 12:34:00,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:34:00,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:34:00,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:34:00,807 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-11-08 12:34:00,811 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-11-08 12:34:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:34:00,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:34:00,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:34:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 12:34:00,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:34:00,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:34:00,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639607636] [2024-11-08 12:34:00,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639607636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:34:00,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:34:00,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:34:00,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291271700] [2024-11-08 12:34:00,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:34:00,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:34:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:34:00,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:34:00,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:34:00,889 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-11-08 12:34:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:34:00,907 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-08 12:34:00,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:34:00,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-11-08 12:34:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:34:00,908 INFO L225 Difference]: With dead ends: 41 [2024-11-08 12:34:00,908 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 12:34:00,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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-11-08 12:34:00,909 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:34:00,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:34:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 12:34:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-08 12:34:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-11-08 12:34:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-08 12:34:00,912 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 24 [2024-11-08 12:34:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:34:00,912 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-08 12:34:00,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-11-08 12:34:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-08 12:34:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 12:34:00,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:34:00,913 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, 1] [2024-11-08 12:34:00,922 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-11-08 12:34:01,113 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-11-08 12:34:01,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:34:01,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:34:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1847075342, now seen corresponding path program 1 times [2024-11-08 12:34:01,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:34:01,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85470189] [2024-11-08 12:34:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:34:01,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:34:01,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:34:01,116 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-11-08 12:34:01,119 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-11-08 12:34:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:34:01,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 12:34:01,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:34:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:34:01,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:34:01,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:34:01,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85470189] [2024-11-08 12:34:01,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85470189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:34:01,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:34:01,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 12:34:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339026552] [2024-11-08 12:34:01,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:34:01,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:34:01,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:34:01,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:34:01,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:34:01,295 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-11-08 12:34:01,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:34:01,432 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-08 12:34:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:34:01,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 25 [2024-11-08 12:34:01,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:34:01,434 INFO L225 Difference]: With dead ends: 38 [2024-11-08 12:34:01,434 INFO L226 Difference]: Without dead ends: 23 [2024-11-08 12:34:01,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 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-11-08 12:34:01,434 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:34:01,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:34:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-08 12:34:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-08 12:34:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-11-08 12:34:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-08 12:34:01,437 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 25 [2024-11-08 12:34:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:34:01,438 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-08 12:34:01,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-11-08 12:34:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-08 12:34:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 12:34:01,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:34:01,439 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:34:01,445 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-11-08 12:34:01,642 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-11-08 12:34:01,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:34:01,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:34:01,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-08 12:34:01,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:34:01,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113793080] [2024-11-08 12:34:01,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:34:01,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 12:34:01,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:34:01,648 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-11-08 12:34:01,651 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-11-08 12:34:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:34:01,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 12:34:01,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:34:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 12:34:01,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:34:01,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:34:01,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113793080] [2024-11-08 12:34:01,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113793080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:34:01,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:34:01,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 12:34:01,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196319002] [2024-11-08 12:34:01,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:34:01,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 12:34:01,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:34:01,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 12:34:01,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 12:34:01,852 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-11-08 12:34:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:34:01,922 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-11-08 12:34:01,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:34:01,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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 26 [2024-11-08 12:34:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:34:01,924 INFO L225 Difference]: With dead ends: 23 [2024-11-08 12:34:01,924 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 12:34:01,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 12:34:01,925 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:34:01,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 119 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:34:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 12:34:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 12:34:01,926 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-11-08 12:34:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 12:34:01,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-08 12:34:01,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:34:01,927 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 12:34:01,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-11-08 12:34:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 12:34:01,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 12:34:01,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 12:34:01,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-08 12:34:02,131 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-11-08 12:34:02,134 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:34:02,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 12:34:02,300 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:34:02,329 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 12:34:02,329 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 12:34:02,329 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 12:34:02,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 12:34:02 BoogieIcfgContainer [2024-11-08 12:34:02,333 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 12:34:02,333 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 12:34:02,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 12:34:02,333 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 12:34:02,334 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:56" (3/4) ... [2024-11-08 12:34:02,335 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 12:34:02,338 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-11-08 12:34:02,341 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-08 12:34:02,341 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-08 12:34:02,342 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 12:34:02,342 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 12:34:02,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 12:34:02,409 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 12:34:02,409 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 12:34:02,409 INFO L158 Benchmark]: Toolchain (without parser) took 6348.45ms. Allocated memory was 60.8MB in the beginning and 100.7MB in the end (delta: 39.8MB). Free memory was 39.2MB in the beginning and 70.8MB in the end (delta: -31.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-08 12:34:02,409 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 60.8MB. Free memory was 35.4MB in the beginning and 35.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:34:02,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.11ms. Allocated memory is still 60.8MB. Free memory was 39.0MB in the beginning and 25.3MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 12:34:02,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.96ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 25.1MB in the beginning and 64.5MB in the end (delta: -39.4MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-11-08 12:34:02,410 INFO L158 Benchmark]: Boogie Preprocessor took 55.97ms. Allocated memory is still 83.9MB. Free memory was 64.5MB in the beginning and 62.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:34:02,410 INFO L158 Benchmark]: RCFGBuilder took 419.33ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 47.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 12:34:02,410 INFO L158 Benchmark]: TraceAbstraction took 5468.17ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 46.4MB in the beginning and 76.0MB in the end (delta: -29.6MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2024-11-08 12:34:02,411 INFO L158 Benchmark]: Witness Printer took 75.74ms. Allocated memory is still 100.7MB. Free memory was 76.0MB in the beginning and 70.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 12:34:02,412 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.97ms. Allocated memory is still 60.8MB. Free memory was 35.4MB in the beginning and 35.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.11ms. Allocated memory is still 60.8MB. Free memory was 39.0MB in the beginning and 25.3MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.96ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 25.1MB in the beginning and 64.5MB in the end (delta: -39.4MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.97ms. Allocated memory is still 83.9MB. Free memory was 64.5MB in the beginning and 62.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.33ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 47.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5468.17ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 46.4MB in the beginning and 76.0MB in the end (delta: -29.6MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * Witness Printer took 75.74ms. Allocated memory is still 100.7MB. Free memory was 76.0MB in the beginning and 70.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: 82]: 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 885 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 610 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 325 IncrementalHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 275 mSDtfsCounter, 325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, InterpolantAutomatonStates: 58, 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.9s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 206 ConstructedInterpolants, 26 QuantifiedInterpolants, 849 SizeOfPredicates, 17 NumberOfNonLiveVariables, 780 ConjunctsInSsa, 84 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: 23]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-08 12:34:02,439 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