./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8009c92c0bc1f14e05253c191e41de2ed06fe66fb83d374469f4967740c9bf82 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:52:29,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:52:29,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:52:29,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:52:29,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:52:29,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:52:29,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:52:29,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:52:29,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:52:29,295 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:52:29,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:52:29,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:52:29,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:52:29,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:52:29,298 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:52:29,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:52:29,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:52:29,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:52:29,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:52:29,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:52:29,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:52:29,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:52:29,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:52:29,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:52:29,301 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:52:29,301 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:52:29,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:52:29,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:52:29,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:52:29,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:52:29,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:52:29,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:52:29,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:52:29,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:52:29,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:52:29,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:52:29,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:52:29,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:52:29,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:52:29,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:52:29,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:52:29,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:52:29,306 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 -> 8009c92c0bc1f14e05253c191e41de2ed06fe66fb83d374469f4967740c9bf82 [2024-11-09 00:52:29,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:52:29,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:52:29,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:52:29,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:52:29,538 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:52:29,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-68.i [2024-11-09 00:52:30,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:52:31,117 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:52:31,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-68.i [2024-11-09 00:52:31,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e774fb7b/b934cb79bea541e0a7115d77badf554d/FLAGf52c13a0c [2024-11-09 00:52:31,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e774fb7b/b934cb79bea541e0a7115d77badf554d [2024-11-09 00:52:31,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:52:31,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:52:31,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:52:31,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:52:31,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:52:31,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b0f248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31, skipping insertion in model container [2024-11-09 00:52:31,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:52:31,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-68.i[915,928] [2024-11-09 00:52:31,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:52:31,404 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:52:31,421 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-68.i[915,928] [2024-11-09 00:52:31,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:52:31,487 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:52:31,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31 WrapperNode [2024-11-09 00:52:31,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:52:31,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:52:31,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:52:31,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:52:31,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,523 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-09 00:52:31,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:52:31,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:52:31,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:52:31,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:52:31,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,544 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:52:31,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:52:31,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:52:31,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:52:31,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:52:31,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (1/1) ... [2024-11-09 00:52:31,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:52:31,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:52:31,608 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-09 00:52:31,610 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-09 00:52:31,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:52:31,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:52:31,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:52:31,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:52:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:52:31,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:52:31,719 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:52:31,721 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:52:31,983 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 00:52:31,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:52:32,000 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:52:32,003 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:52:32,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:52:32 BoogieIcfgContainer [2024-11-09 00:52:32,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:52:32,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:52:32,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:52:32,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:52:32,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:52:31" (1/3) ... [2024-11-09 00:52:32,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2fbdae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:52:32, skipping insertion in model container [2024-11-09 00:52:32,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:31" (2/3) ... [2024-11-09 00:52:32,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2fbdae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:52:32, skipping insertion in model container [2024-11-09 00:52:32,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:52:32" (3/3) ... [2024-11-09 00:52:32,013 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-68.i [2024-11-09 00:52:32,028 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:52:32,028 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:52:32,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:52:32,083 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;@bab7599, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:52:32,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:52:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 00:52:32,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:52:32,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:52:32,096 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:52:32,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:52:32,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:52:32,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2005521531, now seen corresponding path program 1 times [2024-11-09 00:52:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:52:32,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720594657] [2024-11-09 00:52:32,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:32,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:52:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:52:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:52:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:52:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:52:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:52:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:52:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:52:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:52:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:52:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:52:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:52:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:52:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:52:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:52:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 00:52:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:52:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720594657] [2024-11-09 00:52:32,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720594657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:52:32,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:52:32,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:52:32,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980449731] [2024-11-09 00:52:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:52:32,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:52:32,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:52:32,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:52:32,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:52:32,384 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 00:52:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:52:32,401 INFO L93 Difference]: Finished difference Result 103 states and 168 transitions. [2024-11-09 00:52:32,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:52:32,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2024-11-09 00:52:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:52:32,408 INFO L225 Difference]: With dead ends: 103 [2024-11-09 00:52:32,408 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 00:52:32,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-09 00:52:32,413 INFO L432 NwaCegarLoop]: 73 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, 73 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-09 00:52:32,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:52:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 00:52:32,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-09 00:52:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 00:52:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-09 00:52:32,443 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 94 [2024-11-09 00:52:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:52:32,443 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-09 00:52:32,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 00:52:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-09 00:52:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:52:32,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:52:32,447 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:52:32,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:52:32,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:52:32,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:52:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash 640478787, now seen corresponding path program 1 times [2024-11-09 00:52:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:52:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035775707] [2024-11-09 00:52:32,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:32,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:52:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:52:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:52:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:52:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:52:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:52:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:52:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:52:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:52:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:52:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:52:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:52:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:52:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:52:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:52:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 00:52:32,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:52:32,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035775707] [2024-11-09 00:52:32,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035775707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:52:32,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:52:32,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:52:32,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339572889] [2024-11-09 00:52:32,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:52:32,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:52:32,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:52:32,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:52:32,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:52:32,905 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 00:52:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:52:33,016 INFO L93 Difference]: Finished difference Result 118 states and 169 transitions. [2024-11-09 00:52:33,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:52:33,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-09 00:52:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:52:33,020 INFO L225 Difference]: With dead ends: 118 [2024-11-09 00:52:33,020 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 00:52:33,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:52:33,022 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 20 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:52:33,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 182 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:52:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 00:52:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-11-09 00:52:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 00:52:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2024-11-09 00:52:33,034 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 94 [2024-11-09 00:52:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:52:33,036 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2024-11-09 00:52:33,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 00:52:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-11-09 00:52:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 00:52:33,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:52:33,038 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:52:33,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:52:33,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:52:33,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:52:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1914263277, now seen corresponding path program 1 times [2024-11-09 00:52:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:52:33,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953689174] [2024-11-09 00:52:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:52:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:52:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:52:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:52:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:52:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:52:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:52:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:52:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:52:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:52:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:52:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:52:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:52:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:52:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:52:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 00:52:33,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:52:33,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953689174] [2024-11-09 00:52:33,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953689174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:52:33,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903147621] [2024-11-09 00:52:33,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:33,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:52:33,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:52:33,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:52:33,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:52:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:33,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 00:52:33,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:52:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 00:52:33,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:52:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 00:52:33,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903147621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:52:33,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:52:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2024-11-09 00:52:33,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107533815] [2024-11-09 00:52:33,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:52:33,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:52:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:52:33,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:52:33,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:52:33,959 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-09 00:52:34,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:52:34,562 INFO L93 Difference]: Finished difference Result 230 states and 328 transitions. [2024-11-09 00:52:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 00:52:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 95 [2024-11-09 00:52:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:52:34,568 INFO L225 Difference]: With dead ends: 230 [2024-11-09 00:52:34,568 INFO L226 Difference]: Without dead ends: 173 [2024-11-09 00:52:34,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2024-11-09 00:52:34,576 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 148 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:52:34,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 342 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 00:52:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-09 00:52:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 132. [2024-11-09 00:52:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 100 states have (on average 1.36) internal successors, (136), 100 states have internal predecessors, (136), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 00:52:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 192 transitions. [2024-11-09 00:52:34,599 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 192 transitions. Word has length 95 [2024-11-09 00:52:34,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:52:34,599 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 192 transitions. [2024-11-09 00:52:34,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 15 states have internal predecessors, (61), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-09 00:52:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 192 transitions. [2024-11-09 00:52:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 00:52:34,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:52:34,601 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:52:34,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 00:52:34,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:52:34,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:52:34,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:52:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash -979012706, now seen corresponding path program 1 times [2024-11-09 00:52:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:52:34,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777908864] [2024-11-09 00:52:34,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:34,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:52:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:52:34,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2077405215] [2024-11-09 00:52:34,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:34,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:52:34,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:52:34,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:52:34,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:52:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:34,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 00:52:34,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:52:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 00:52:35,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:52:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:52:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777908864] [2024-11-09 00:52:35,218 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 00:52:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077405215] [2024-11-09 00:52:35,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077405215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:52:35,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:52:35,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:52:35,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504053093] [2024-11-09 00:52:35,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:52:35,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:52:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:52:35,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:52:35,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:52:35,220 INFO L87 Difference]: Start difference. First operand 132 states and 192 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 00:52:35,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:52:35,373 INFO L93 Difference]: Finished difference Result 297 states and 431 transitions. [2024-11-09 00:52:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:52:35,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2024-11-09 00:52:35,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:52:35,376 INFO L225 Difference]: With dead ends: 297 [2024-11-09 00:52:35,376 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 00:52:35,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:52:35,378 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 21 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:52:35,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 271 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:52:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 00:52:35,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-09 00:52:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 118 states have internal predecessors, (155), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 00:52:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2024-11-09 00:52:35,395 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 96 [2024-11-09 00:52:35,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:52:35,396 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2024-11-09 00:52:35,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 00:52:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2024-11-09 00:52:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 00:52:35,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:52:35,397 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:52:35,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:52:35,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 00:52:35,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:52:35,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:52:35,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1781855615, now seen corresponding path program 1 times [2024-11-09 00:52:35,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:52:35,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128219066] [2024-11-09 00:52:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:52:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:52:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:52:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:52:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:52:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:52:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:52:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:52:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:52:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:52:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:52:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:52:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:52:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:52:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:52:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 00:52:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:52:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128219066] [2024-11-09 00:52:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128219066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:52:36,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:52:36,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 00:52:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424985606] [2024-11-09 00:52:36,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:52:36,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:52:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:52:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:52:36,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:52:36,085 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 00:52:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:52:36,494 INFO L93 Difference]: Finished difference Result 359 states and 507 transitions. [2024-11-09 00:52:36,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:52:36,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-09 00:52:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:52:36,497 INFO L225 Difference]: With dead ends: 359 [2024-11-09 00:52:36,497 INFO L226 Difference]: Without dead ends: 230 [2024-11-09 00:52:36,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:52:36,498 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 145 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:52:36,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 415 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:52:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-09 00:52:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 209. [2024-11-09 00:52:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 152 states have (on average 1.25) internal successors, (190), 154 states have internal predecessors, (190), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-09 00:52:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2024-11-09 00:52:36,519 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 288 transitions. Word has length 98 [2024-11-09 00:52:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:52:36,520 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 288 transitions. [2024-11-09 00:52:36,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 00:52:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2024-11-09 00:52:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 00:52:36,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:52:36,521 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:52:36,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:52:36,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:52:36,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:52:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash -776852473, now seen corresponding path program 1 times [2024-11-09 00:52:36,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:52:36,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888188899] [2024-11-09 00:52:36,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:52:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:52:36,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2035160285] [2024-11-09 00:52:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:36,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:52:36,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:52:36,557 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:52:36,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 00:52:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:52:36,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:52:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:52:36,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:52:36,708 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:52:36,709 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:52:36,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 00:52:36,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:52:36,915 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 00:52:36,982 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:52:36,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:52:36 BoogieIcfgContainer [2024-11-09 00:52:36,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:52:36,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:52:36,986 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:52:36,986 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:52:36,986 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:52:32" (3/4) ... [2024-11-09 00:52:36,989 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:52:36,990 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:52:36,990 INFO L158 Benchmark]: Toolchain (without parser) took 5846.60ms. Allocated memory was 192.9MB in the beginning and 249.6MB in the end (delta: 56.6MB). Free memory was 120.2MB in the beginning and 170.2MB in the end (delta: -50.0MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-11-09 00:52:36,990 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:52:36,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.87ms. Allocated memory is still 192.9MB. Free memory was 120.0MB in the beginning and 159.4MB in the end (delta: -39.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 00:52:36,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.51ms. Allocated memory is still 192.9MB. Free memory was 159.4MB in the beginning and 157.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:52:36,991 INFO L158 Benchmark]: Boogie Preprocessor took 36.33ms. Allocated memory is still 192.9MB. Free memory was 157.3MB in the beginning and 155.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:52:36,991 INFO L158 Benchmark]: RCFGBuilder took 442.48ms. Allocated memory is still 192.9MB. Free memory was 155.2MB in the beginning and 139.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 00:52:36,991 INFO L158 Benchmark]: TraceAbstraction took 4980.41ms. Allocated memory was 192.9MB in the beginning and 249.6MB in the end (delta: 56.6MB). Free memory was 139.0MB in the beginning and 171.2MB in the end (delta: -32.2MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-11-09 00:52:36,992 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 249.6MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:52:36,993 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.87ms. Allocated memory is still 192.9MB. Free memory was 120.0MB in the beginning and 159.4MB in the end (delta: -39.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.51ms. Allocated memory is still 192.9MB. Free memory was 159.4MB in the beginning and 157.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.33ms. Allocated memory is still 192.9MB. Free memory was 157.3MB in the beginning and 155.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.48ms. Allocated memory is still 192.9MB. Free memory was 155.2MB in the beginning and 139.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4980.41ms. Allocated memory was 192.9MB in the beginning and 249.6MB in the end (delta: 56.6MB). Free memory was 139.0MB in the beginning and 171.2MB in the end (delta: -32.2MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 249.6MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of shiftRight at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] float var_1_2 = 64.5; [L24] float var_1_3 = 16.8; [L25] signed long int var_1_8 = 10; [L26] signed long int var_1_9 = 25; [L27] double var_1_10 = 0.75; [L28] signed long int var_1_11 = 2; [L29] signed long int var_1_12 = 32; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 0; [L32] double var_1_15 = 50.2; [L33] signed long int last_1_var_1_9 = 25; [L34] double last_1_var_1_10 = 0.75; VAL [isInitial=0, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=25] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L90] last_1_var_1_9 = var_1_9 [L91] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=25] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L67] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_3=84/5, var_1_8=10, var_1_9=25] [L68] var_1_3 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L69] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=10, var_1_9=25] [L70] var_1_8 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L71] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L72] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L73] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=2, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L74] var_1_11 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L75] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L76] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L76] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L77] var_1_12 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L78] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L79] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L79] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L80] var_1_13 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L81] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L82] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L82] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L83] var_1_14 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L84] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L85] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L85] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=251/5, var_1_1=32, var_1_8=27, var_1_9=25] [L86] var_1_15 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L87] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L102] RET updateVariables() [L103] CALL step() [L38] signed long int stepLocal_0 = last_1_var_1_9 + last_1_var_1_9; VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=32, var_1_8=27, var_1_9=25] [L39] COND FALSE !((var_1_2 - var_1_3) >= last_1_var_1_10) [L44] var_1_1 = last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L46] signed long int stepLocal_2 = var_1_1; [L47] signed long int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_1=25, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L48] EXPR var_1_8 >> last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_1=25, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L48] COND FALSE !((var_1_8 >> last_1_var_1_9) > stepLocal_1) [L55] var_1_9 = last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L57] COND TRUE ((((var_1_9) > (var_1_1)) ? (var_1_9) : (var_1_1))) == (var_1_9 * (var_1_11 - var_1_12)) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=3/4, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_1=25, var_1_8=27, var_1_9=25] [L58] COND TRUE var_1_13 || var_1_14 [L59] var_1_10 = var_1_15 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, stepLocal_0=50, stepLocal_2=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR (((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9))) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94] EXPR var_1_8 >> last_1_var_1_9 VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94] EXPR (((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9))) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L94-L95] return ((((var_1_2 - var_1_3) >= last_1_var_1_10) ? (((last_1_var_1_9 + last_1_var_1_9) >= (last_1_var_1_9 / var_1_8)) ? (var_1_1 == ((signed long int) last_1_var_1_9)) : 1) : (var_1_1 == ((signed long int) last_1_var_1_9))) && (((var_1_8 >> last_1_var_1_9) > var_1_1) ? (((var_1_1 >> 8) > var_1_1) ? (var_1_9 == ((signed long int) var_1_1)) : (var_1_9 == ((signed long int) last_1_var_1_9))) : (var_1_9 == ((signed long int) last_1_var_1_9)))) && ((((((var_1_9) > (var_1_1)) ? (var_1_9) : (var_1_1))) == (var_1_9 * (var_1_11 - var_1_12))) ? ((var_1_13 || var_1_14) ? (var_1_10 == ((double) var_1_15)) : (var_1_10 == ((double) var_1_15))) : 1) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=3/4, last_1_var_1_9=25, var_1_10=2, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=2, var_1_1=25, var_1_8=27, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 1283 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 938 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 932 IncrementalHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 345 mSDtfsCounter, 932 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 5 MinimizatonAttempts, 72 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 866 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 2176 SizeOfPredicates, 7 NumberOfNonLiveVariables, 446 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 2467/2548 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-09 00:52:37,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8009c92c0bc1f14e05253c191e41de2ed06fe66fb83d374469f4967740c9bf82 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:52:38,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:52:39,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:52:39,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:52:39,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:52:39,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:52:39,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:52:39,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:52:39,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:52:39,079 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:52:39,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:52:39,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:52:39,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:52:39,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:52:39,080 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:52:39,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:52:39,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:52:39,081 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:52:39,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:52:39,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:52:39,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:52:39,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:52:39,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:52:39,085 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:52:39,085 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:52:39,085 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:52:39,085 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:52:39,085 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:52:39,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:52:39,086 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:52:39,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:52:39,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:52:39,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:52:39,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:52:39,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:52:39,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:52:39,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:52:39,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:52:39,097 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:52:39,097 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:52:39,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:52:39,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:52:39,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:52:39,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:52:39,099 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 -> 8009c92c0bc1f14e05253c191e41de2ed06fe66fb83d374469f4967740c9bf82 [2024-11-09 00:52:39,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:52:39,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:52:39,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:52:39,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:52:39,387 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:52:39,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-68.i [2024-11-09 00:52:40,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:52:40,951 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:52:40,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-68.i [2024-11-09 00:52:40,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a5266e9/c04830e6aeea4f00aa70568d98f27c7d/FLAG0db8052d9 [2024-11-09 00:52:40,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a5266e9/c04830e6aeea4f00aa70568d98f27c7d [2024-11-09 00:52:40,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:52:40,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:52:40,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:52:40,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:52:40,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:52:40,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:52:40" (1/1) ... [2024-11-09 00:52:40,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29922785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:40, skipping insertion in model container [2024-11-09 00:52:40,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:52:40" (1/1) ... [2024-11-09 00:52:41,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:52:41,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-68.i[915,928] [2024-11-09 00:52:41,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:52:41,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:52:41,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-68.i[915,928] [2024-11-09 00:52:41,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:52:41,264 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:52:41,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41 WrapperNode [2024-11-09 00:52:41,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:52:41,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:52:41,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:52:41,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:52:41,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,308 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-11-09 00:52:41,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:52:41,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:52:41,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:52:41,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:52:41,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,340 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:52:41,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:52:41,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:52:41,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:52:41,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:52:41,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (1/1) ... [2024-11-09 00:52:41,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:52:41,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:52:41,400 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-09 00:52:41,404 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-09 00:52:41,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:52:41,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:52:41,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:52:41,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:52:41,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:52:41,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:52:41,517 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:52:41,519 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:52:42,549 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 00:52:42,549 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:52:42,558 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:52:42,559 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:52:42,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:52:42 BoogieIcfgContainer [2024-11-09 00:52:42,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:52:42,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:52:42,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:52:42,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:52:42,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:52:40" (1/3) ... [2024-11-09 00:52:42,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1358c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:52:42, skipping insertion in model container [2024-11-09 00:52:42,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:52:41" (2/3) ... [2024-11-09 00:52:42,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1358c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:52:42, skipping insertion in model container [2024-11-09 00:52:42,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:52:42" (3/3) ... [2024-11-09 00:52:42,570 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-68.i [2024-11-09 00:52:42,582 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:52:42,582 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:52:42,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:52:42,650 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;@1f5db839, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:52:42,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:52:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 00:52:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 00:52:42,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:52:42,664 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:52:42,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:52:42,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:52:42,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1497127040, now seen corresponding path program 1 times [2024-11-09 00:52:42,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:52:42,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085536102] [2024-11-09 00:52:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:42,681 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-09 00:52:42,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:52:42,684 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-09 00:52:42,685 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-09 00:52:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:42,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:52:42,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:52:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-09 00:52:42,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:52:42,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:52:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085536102] [2024-11-09 00:52:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085536102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:52:42,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:52:42,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:52:42,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795374982] [2024-11-09 00:52:42,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:52:42,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:52:42,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:52:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:52:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:52:43,006 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 00:52:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:52:43,026 INFO L93 Difference]: Finished difference Result 89 states and 148 transitions. [2024-11-09 00:52:43,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:52:43,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-09 00:52:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:52:43,033 INFO L225 Difference]: With dead ends: 89 [2024-11-09 00:52:43,033 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 00:52:43,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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-09 00:52:43,037 INFO L432 NwaCegarLoop]: 63 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, 63 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-09 00:52:43,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:52:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 00:52:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 00:52:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 00:52:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-11-09 00:52:43,067 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 91 [2024-11-09 00:52:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:52:43,068 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-11-09 00:52:43,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 00:52:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-11-09 00:52:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 00:52:43,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:52:43,071 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:52:43,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 00:52:43,272 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-09 00:52:43,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:52:43,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:52:43,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1721553848, now seen corresponding path program 1 times [2024-11-09 00:52:43,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:52:43,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920241672] [2024-11-09 00:52:43,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:52:43,275 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-09 00:52:43,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:52:43,278 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-09 00:52:43,279 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-09 00:52:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:52:43,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 00:52:43,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:52:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 00:52:54,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:52:54,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:52:54,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920241672] [2024-11-09 00:52:54,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920241672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:52:54,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:52:54,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 00:52:54,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985795847] [2024-11-09 00:52:54,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:52:54,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:52:54,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:52:54,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:52:54,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:52:54,957 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 00:53:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:53:29,318 INFO L93 Difference]: Finished difference Result 113 states and 157 transitions. [2024-11-09 00:53:29,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:53:29,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-09 00:53:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:53:29,336 INFO L225 Difference]: With dead ends: 113 [2024-11-09 00:53:29,336 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 00:53:29,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 00:53:29,337 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:53:29,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 298 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 30.4s Time] [2024-11-09 00:53:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 00:53:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2024-11-09 00:53:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 59 states have internal predecessors, (76), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 00:53:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-11-09 00:53:29,357 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 91 [2024-11-09 00:53:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:53:29,358 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-11-09 00:53:29,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 00:53:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-11-09 00:53:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 00:53:29,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:53:29,360 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:53:29,371 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-09 00:53:29,564 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-09 00:53:29,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:53:29,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:53:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1593001437, now seen corresponding path program 1 times [2024-11-09 00:53:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:53:29,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143382505] [2024-11-09 00:53:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:53:29,572 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-09 00:53:29,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:53:29,573 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-09 00:53:29,575 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-09 00:53:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:53:29,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 00:53:29,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:53:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 00:53:57,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:53:57,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:53:57,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143382505] [2024-11-09 00:53:57,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143382505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:53:57,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:53:57,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 00:53:57,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101793426] [2024-11-09 00:53:57,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:53:57,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 00:53:57,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:53:57,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 00:53:57,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 00:53:57,298 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14)