./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-47.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 1cfc7ddeb243a6fbee63082d52fa8fcfb4ff8d84616bad6a23c283e264c1cd83 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:03:39,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:03:39,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:03:39,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:03:39,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:03:39,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:03:39,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:03:39,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:03:39,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:03:39,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:03:39,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:03:39,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:03:39,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:03:39,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:03:39,293 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:03:39,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:03:39,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:03:39,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:03:39,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:03:39,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:03:39,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:03:39,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:03:39,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:03:39,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:03:39,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:03:39,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:03:39,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:03:39,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:03:39,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:03:39,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:03:39,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:03:39,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:03:39,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:03:39,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:03:39,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:03:39,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:03:39,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:03:39,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:03:39,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:03:39,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:03:39,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:03:39,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:03:39,299 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 -> 1cfc7ddeb243a6fbee63082d52fa8fcfb4ff8d84616bad6a23c283e264c1cd83 [2024-11-20 08:03:39,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:03:39,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:03:39,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:03:39,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:03:39,547 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:03:39,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-47.i [2024-11-20 08:03:40,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:03:40,888 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:03:40,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-47.i [2024-11-20 08:03:40,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e8550411/6bba9dd583664d46af02e5eda560d96b/FLAG05dd134be [2024-11-20 08:03:41,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e8550411/6bba9dd583664d46af02e5eda560d96b [2024-11-20 08:03:41,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:03:41,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:03:41,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:03:41,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:03:41,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:03:41,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d6dff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41, skipping insertion in model container [2024-11-20 08:03:41,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:03:41,465 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_amount50_file-47.i[915,928] [2024-11-20 08:03:41,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:03:41,517 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:03:41,527 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_amount50_file-47.i[915,928] [2024-11-20 08:03:41,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:03:41,573 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:03:41,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41 WrapperNode [2024-11-20 08:03:41,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:03:41,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:03:41,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:03:41,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:03:41,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,617 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-20 08:03:41,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:03:41,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:03:41,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:03:41,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:03:41,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,648 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 08:03:41,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:03:41,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:03:41,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:03:41,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:03:41,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (1/1) ... [2024-11-20 08:03:41,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:03:41,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:03:41,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:03:41,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:03:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:03:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:03:41,747 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:03:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:03:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:03:41,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:03:41,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:03:41,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:03:42,141 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-20 08:03:42,142 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:03:42,154 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:03:42,155 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:03:42,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:03:42 BoogieIcfgContainer [2024-11-20 08:03:42,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:03:42,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:03:42,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:03:42,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:03:42,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:03:41" (1/3) ... [2024-11-20 08:03:42,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69911d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:03:42, skipping insertion in model container [2024-11-20 08:03:42,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:03:41" (2/3) ... [2024-11-20 08:03:42,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69911d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:03:42, skipping insertion in model container [2024-11-20 08:03:42,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:03:42" (3/3) ... [2024-11-20 08:03:42,164 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-47.i [2024-11-20 08:03:42,177 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:03:42,177 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:03:42,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:03:42,282 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;@a62eb42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:03:42,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:03:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:03:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 08:03:42,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:03:42,304 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:03:42,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:03:42,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:03:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1126597033, now seen corresponding path program 1 times [2024-11-20 08:03:42,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:03:42,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312589237] [2024-11-20 08:03:42,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:42,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:03:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:03:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:03:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:03:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:03:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:03:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:03:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:03:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:03:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:03:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:03:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:03:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:03:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:03:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:03:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:03:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:03:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 08:03:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 08:03:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 08:03:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 08:03:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:03:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:03:42,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:03:42,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312589237] [2024-11-20 08:03:42,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312589237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:03:42,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:03:42,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:03:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014963898] [2024-11-20 08:03:42,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:03:42,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:03:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:03:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:03:42,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:03:42,711 INFO L87 Difference]: Start difference. First operand has 89 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:03:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:03:42,741 INFO L93 Difference]: Finished difference Result 171 states and 291 transitions. [2024-11-20 08:03:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:03:42,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2024-11-20 08:03:42,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:03:42,752 INFO L225 Difference]: With dead ends: 171 [2024-11-20 08:03:42,753 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 08:03:42,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:03:42,759 INFO L432 NwaCegarLoop]: 127 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, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:03:42,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:03:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 08:03:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-20 08:03:42,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:03:42,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-11-20 08:03:42,798 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 140 [2024-11-20 08:03:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:03:42,798 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-11-20 08:03:42,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:03:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-11-20 08:03:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-20 08:03:42,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:03:42,804 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:03:42,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:03:42,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:03:42,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:03:42,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1816447203, now seen corresponding path program 1 times [2024-11-20 08:03:42,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:03:42,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621217278] [2024-11-20 08:03:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:42,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:03:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:03:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:03:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:03:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:03:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:03:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:03:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:03:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:03:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:03:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:03:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:03:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:03:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:03:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:03:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:03:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:03:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 08:03:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 08:03:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 08:03:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 08:03:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:03:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:03:43,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:03:43,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621217278] [2024-11-20 08:03:43,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621217278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:03:43,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:03:43,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:03:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024176463] [2024-11-20 08:03:43,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:03:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:03:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:03:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:03:43,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:03:43,353 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:03:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:03:43,660 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2024-11-20 08:03:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:03:43,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-11-20 08:03:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:03:43,664 INFO L225 Difference]: With dead ends: 363 [2024-11-20 08:03:43,664 INFO L226 Difference]: Without dead ends: 281 [2024-11-20 08:03:43,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:03:43,666 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 303 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:03:43,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 514 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:03:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-20 08:03:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 177. [2024-11-20 08:03:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 132 states have (on average 1.371212121212121) internal successors, (181), 132 states have internal predecessors, (181), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:03:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 265 transitions. [2024-11-20 08:03:43,698 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 265 transitions. Word has length 141 [2024-11-20 08:03:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:03:43,699 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 265 transitions. [2024-11-20 08:03:43,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:03:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 265 transitions. [2024-11-20 08:03:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-20 08:03:43,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:03:43,703 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:03:43,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:03:43,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:03:43,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:03:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash 789576351, now seen corresponding path program 1 times [2024-11-20 08:03:43,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:03:43,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922788335] [2024-11-20 08:03:43,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:43,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:03:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:03:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:03:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:03:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:03:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:03:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:03:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:03:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:03:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:03:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:03:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:03:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:03:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:03:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:03:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:03:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:03:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 08:03:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 08:03:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 08:03:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 08:03:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:03:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:03:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:03:44,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922788335] [2024-11-20 08:03:44,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922788335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:03:44,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:03:44,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:03:44,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276922913] [2024-11-20 08:03:44,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:03:44,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:03:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:03:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:03:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:03:44,181 INFO L87 Difference]: Start difference. First operand 177 states and 265 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:03:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:03:44,387 INFO L93 Difference]: Finished difference Result 342 states and 509 transitions. [2024-11-20 08:03:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:03:44,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-11-20 08:03:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:03:44,391 INFO L225 Difference]: With dead ends: 342 [2024-11-20 08:03:44,393 INFO L226 Difference]: Without dead ends: 168 [2024-11-20 08:03:44,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-20 08:03:44,395 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 88 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:03:44,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 341 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:03:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-20 08:03:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2024-11-20 08:03:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:03:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-11-20 08:03:44,423 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 141 [2024-11-20 08:03:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:03:44,423 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-11-20 08:03:44,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:03:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-11-20 08:03:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 08:03:44,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:03:44,425 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:03:44,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:03:44,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:03:44,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:03:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1594952904, now seen corresponding path program 1 times [2024-11-20 08:03:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:03:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336084421] [2024-11-20 08:03:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:03:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:03:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:03:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:03:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:03:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:03:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:03:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:03:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:03:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:03:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:03:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:03:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:03:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:03:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:03:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:03:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:03:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 08:03:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 08:03:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 08:03:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:45,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 08:03:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:45,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:03:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:03:45,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:03:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336084421] [2024-11-20 08:03:45,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336084421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:03:45,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:03:45,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:03:45,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39854930] [2024-11-20 08:03:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:03:45,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:03:45,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:03:45,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:03:45,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:03:45,027 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:03:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:03:45,406 INFO L93 Difference]: Finished difference Result 361 states and 534 transitions. [2024-11-20 08:03:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:03:45,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 143 [2024-11-20 08:03:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:03:45,411 INFO L225 Difference]: With dead ends: 361 [2024-11-20 08:03:45,411 INFO L226 Difference]: Without dead ends: 279 [2024-11-20 08:03:45,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:03:45,414 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 255 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:03:45,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 373 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:03:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-20 08:03:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 274. [2024-11-20 08:03:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 204 states have (on average 1.3186274509803921) internal successors, (269), 205 states have internal predecessors, (269), 65 states have call successors, (65), 4 states have call predecessors, (65), 4 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-20 08:03:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 399 transitions. [2024-11-20 08:03:45,456 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 399 transitions. Word has length 143 [2024-11-20 08:03:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:03:45,457 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 399 transitions. [2024-11-20 08:03:45,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:03:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 399 transitions. [2024-11-20 08:03:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 08:03:45,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:03:45,462 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:03:45,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:03:45,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:03:45,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:03:45,463 INFO L85 PathProgramCache]: Analyzing trace with hash 872076683, now seen corresponding path program 1 times [2024-11-20 08:03:45,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:03:45,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147230162] [2024-11-20 08:03:45,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:45,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:03:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:03:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:03:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:03:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:03:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:03:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:03:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:03:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:03:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:03:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:03:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:03:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:03:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:03:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:03:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:03:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:03:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 08:03:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 08:03:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 08:03:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 08:03:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:03:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 48 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-20 08:03:46,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:03:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147230162] [2024-11-20 08:03:46,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147230162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:03:46,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363964482] [2024-11-20 08:03:46,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:46,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:03:46,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:03:46,286 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:03:46,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 08:03:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:46,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 08:03:46,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:03:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 309 proven. 90 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-20 08:03:47,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:03:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 57 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2024-11-20 08:03:48,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363964482] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:03:48,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 08:03:48,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 12] total 34 [2024-11-20 08:03:48,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883178213] [2024-11-20 08:03:48,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 08:03:48,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-20 08:03:48,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:03:48,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-20 08:03:48,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 08:03:48,373 INFO L87 Difference]: Start difference. First operand 274 states and 399 transitions. Second operand has 34 states, 32 states have (on average 4.1875) internal successors, (134), 30 states have internal predecessors, (134), 10 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 13 states have call predecessors, (63), 10 states have call successors, (63) [2024-11-20 08:03:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:03:52,429 INFO L93 Difference]: Finished difference Result 881 states and 1226 transitions. [2024-11-20 08:03:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-11-20 08:03:52,430 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 4.1875) internal successors, (134), 30 states have internal predecessors, (134), 10 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 13 states have call predecessors, (63), 10 states have call successors, (63) Word has length 144 [2024-11-20 08:03:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:03:52,435 INFO L225 Difference]: With dead ends: 881 [2024-11-20 08:03:52,436 INFO L226 Difference]: Without dead ends: 669 [2024-11-20 08:03:52,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2753, Invalid=10357, Unknown=0, NotChecked=0, Total=13110 [2024-11-20 08:03:52,440 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 1213 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 2981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:03:52,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1878 Invalid, 2981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 08:03:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-20 08:03:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 384. [2024-11-20 08:03:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 304 states have (on average 1.3125) internal successors, (399), 305 states have internal predecessors, (399), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-20 08:03:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 529 transitions. [2024-11-20 08:03:52,502 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 529 transitions. Word has length 144 [2024-11-20 08:03:52,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:03:52,505 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 529 transitions. [2024-11-20 08:03:52,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 4.1875) internal successors, (134), 30 states have internal predecessors, (134), 10 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 13 states have call predecessors, (63), 10 states have call successors, (63) [2024-11-20 08:03:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 529 transitions. [2024-11-20 08:03:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 08:03:52,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:03:52,507 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:03:52,518 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-20 08:03:52,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:03:52,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:03:52,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:03:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1663097356, now seen corresponding path program 1 times [2024-11-20 08:03:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:03:52,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192881170] [2024-11-20 08:03:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:03:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:03:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:03:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:03:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:03:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:03:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:03:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:03:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:03:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:03:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:03:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:03:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:03:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:03:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:03:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:03:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:03:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 08:03:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 08:03:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 08:03:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 08:03:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:03:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:03:52,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:03:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192881170] [2024-11-20 08:03:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192881170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:03:52,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:03:52,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:03:52,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701507476] [2024-11-20 08:03:52,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:03:52,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:03:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:03:52,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:03:52,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:03:52,863 INFO L87 Difference]: Start difference. First operand 384 states and 529 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:03:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:03:52,977 INFO L93 Difference]: Finished difference Result 776 states and 1073 transitions. [2024-11-20 08:03:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:03:52,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-20 08:03:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:03:52,985 INFO L225 Difference]: With dead ends: 776 [2024-11-20 08:03:52,985 INFO L226 Difference]: Without dead ends: 601 [2024-11-20 08:03:52,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-20 08:03:52,986 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 106 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:03:52,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 437 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:03:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-20 08:03:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 418. [2024-11-20 08:03:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 338 states have (on average 1.2958579881656804) internal successors, (438), 339 states have internal predecessors, (438), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-20 08:03:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 568 transitions. [2024-11-20 08:03:53,023 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 568 transitions. Word has length 144 [2024-11-20 08:03:53,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:03:53,024 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 568 transitions. [2024-11-20 08:03:53,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:03:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 568 transitions. [2024-11-20 08:03:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 08:03:53,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:03:53,025 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:03:53,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:03:53,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:03:53,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:03:53,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1260780451, now seen corresponding path program 1 times [2024-11-20 08:03:53,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:03:53,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773510100] [2024-11-20 08:03:53,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:53,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:03:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:03:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:03:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:03:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:03:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:03:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:03:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:03:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:03:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:03:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:03:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:03:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:03:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:03:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:03:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:03:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:03:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 08:03:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 08:03:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 08:03:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 08:03:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:03:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,380 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-20 08:03:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:03:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773510100] [2024-11-20 08:03:53,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773510100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:03:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883294411] [2024-11-20 08:03:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:53,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:03:53,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:03:53,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:03:53,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 08:03:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:53,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 08:03:53,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:03:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 188 proven. 102 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-20 08:03:54,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:03:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-20 08:03:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883294411] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:03:54,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 08:03:54,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 19 [2024-11-20 08:03:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102587887] [2024-11-20 08:03:54,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 08:03:54,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 08:03:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:03:54,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 08:03:54,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-11-20 08:03:54,496 INFO L87 Difference]: Start difference. First operand 418 states and 568 transitions. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 18 states have internal predecessors, (105), 7 states have call successors, (63), 4 states have call predecessors, (63), 7 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) [2024-11-20 08:03:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:03:55,033 INFO L93 Difference]: Finished difference Result 740 states and 1006 transitions. [2024-11-20 08:03:55,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 08:03:55,034 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 18 states have internal predecessors, (105), 7 states have call successors, (63), 4 states have call predecessors, (63), 7 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) Word has length 145 [2024-11-20 08:03:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:03:55,036 INFO L225 Difference]: With dead ends: 740 [2024-11-20 08:03:55,036 INFO L226 Difference]: Without dead ends: 396 [2024-11-20 08:03:55,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2024-11-20 08:03:55,037 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 307 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:03:55,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 911 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:03:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-20 08:03:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 385. [2024-11-20 08:03:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 305 states have (on average 1.278688524590164) internal successors, (390), 306 states have internal predecessors, (390), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-20 08:03:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 520 transitions. [2024-11-20 08:03:55,068 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 520 transitions. Word has length 145 [2024-11-20 08:03:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:03:55,069 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 520 transitions. [2024-11-20 08:03:55,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 18 states have internal predecessors, (105), 7 states have call successors, (63), 4 states have call predecessors, (63), 7 states have return successors, (63), 7 states have call predecessors, (63), 7 states have call successors, (63) [2024-11-20 08:03:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 520 transitions. [2024-11-20 08:03:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 08:03:55,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:03:55,070 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:03:55,077 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-20 08:03:55,270 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,SelfDestructingSolverStorable6 [2024-11-20 08:03:55,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:03:55,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:03:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1267294736, now seen corresponding path program 1 times [2024-11-20 08:03:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:03:55,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328519467] [2024-11-20 08:03:55,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:55,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:03:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:03:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885405658] [2024-11-20 08:03:55,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:55,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:03:55,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:03:55,328 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-20 08:03:55,329 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-20 08:03:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:03:55,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 08:03:55,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:03:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-20 08:03:55,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:03:56,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:03:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328519467] [2024-11-20 08:03:56,071 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 08:03:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885405658] [2024-11-20 08:03:56,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885405658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:03:56,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:03:56,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-20 08:03:56,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607689815] [2024-11-20 08:03:56,071 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 08:03:56,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:03:56,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:03:56,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:03:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:03:56,073 INFO L87 Difference]: Start difference. First operand 385 states and 520 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:03:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:03:56,275 INFO L93 Difference]: Finished difference Result 698 states and 949 transitions. [2024-11-20 08:03:56,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:03:56,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 146 [2024-11-20 08:03:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:03:56,278 INFO L225 Difference]: With dead ends: 698 [2024-11-20 08:03:56,278 INFO L226 Difference]: Without dead ends: 393 [2024-11-20 08:03:56,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:03:56,279 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 50 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:03:56,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 578 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:03:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-20 08:03:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 387. [2024-11-20 08:03:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 307 states have (on average 1.276872964169381) internal successors, (392), 308 states have internal predecessors, (392), 65 states have call successors, (65), 14 states have call predecessors, (65), 14 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-20 08:03:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 522 transitions. [2024-11-20 08:03:56,310 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 522 transitions. Word has length 146 [2024-11-20 08:03:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:03:56,310 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 522 transitions. [2024-11-20 08:03:56,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 08:03:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 522 transitions. [2024-11-20 08:03:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 08:03:56,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:03:56,311 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:03:56,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 08:03:56,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:03:56,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:03:56,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:03:56,513 INFO L85 PathProgramCache]: Analyzing trace with hash 507712626, now seen corresponding path program 1 times [2024-11-20 08:03:56,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:03:56,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055263125] [2024-11-20 08:03:56,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:56,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:03:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:03:56,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516786567] [2024-11-20 08:03:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:03:56,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:03:56,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:03:56,570 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:03:56,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 08:03:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:03:56,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:03:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:03:56,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:03:56,955 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:03:56,955 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:03:56,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 08:03:57,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:03:57,163 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:03:57,240 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:03:57,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:03:57 BoogieIcfgContainer [2024-11-20 08:03:57,243 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:03:57,244 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:03:57,244 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:03:57,244 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:03:57,244 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:03:42" (3/4) ... [2024-11-20 08:03:57,246 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:03:57,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:03:57,247 INFO L158 Benchmark]: Toolchain (without parser) took 15960.78ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 136.8MB in the beginning and 293.7MB in the end (delta: -156.9MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-11-20 08:03:57,248 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:03:57,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.15ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 119.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 08:03:57,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.76ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 115.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:03:57,248 INFO L158 Benchmark]: Boogie Preprocessor took 61.09ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 108.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 08:03:57,248 INFO L158 Benchmark]: RCFGBuilder took 476.67ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 80.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-20 08:03:57,249 INFO L158 Benchmark]: TraceAbstraction took 15085.44ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 79.7MB in the beginning and 293.7MB in the end (delta: -214.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:03:57,249 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 352.3MB. Free memory is still 293.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:03:57,250 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.12ms. Allocated memory is still 117.4MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.15ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 119.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.76ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 115.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.09ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 108.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 476.67ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 80.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15085.44ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 79.7MB in the beginning and 293.7MB in the end (delta: -214.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 352.3MB. Free memory is still 293.7MB. 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 someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of bitwiseOr at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] unsigned char last_1_var_1_8 = 64; [L42] unsigned char last_1_var_1_19 = 1; [L43] unsigned short int last_1_var_1_20 = 256; [L44] unsigned long int last_1_var_1_22 = 64; VAL [isInitial=0, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_8 = var_1_8 [L128] last_1_var_1_19 = var_1_19 [L129] last_1_var_1_20 = var_1_20 [L130] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && 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_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L93] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && 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_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L95] var_1_4 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L96] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L98] var_1_5 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_6=10, var_1_8=64, var_1_9=5] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_6=10, var_1_8=64, var_1_9=5] [L100] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L101] var_1_6 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_8=64, var_1_9=5] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_8=64, var_1_9=5] [L103] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L104] var_1_9 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64] [L105] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64] [L106] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L107] var_1_11 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L108] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L110] var_1_13 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L111] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L113] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L114] var_1_15 = __VERIFIER_nondet_float() [L115] 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_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L115] 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_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L116] var_1_17 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L122] var_1_21 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L123] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L141] RET updateVariables() [L142] CALL step() [L48] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L49] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L53] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=16383, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L54] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L59] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=-81922, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L60] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L61] COND TRUE \read(var_1_16) [L62] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L69] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L70] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L76] COND TRUE var_1_12 >= (1.3 / var_1_3) [L77] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L81] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L82] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L83] COND TRUE stepLocal_1 || var_1_16 [L84] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L133-L134] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=-81922, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 9, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2332 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2322 mSDsluCounter, 5159 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4013 mSDsCounter, 718 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3950 IncrementalHoareTripleChecker+Invalid, 4668 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 718 mSolverCounterUnsat, 1146 mSDtfsCounter, 3950 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1320 GetRequests, 1153 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4415 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=6, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 625 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1871 NumberOfCodeBlocks, 1871 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1710 ConstructedInterpolants, 0 QuantifiedInterpolants, 11231 SizeOfPredicates, 13 NumberOfNonLiveVariables, 998 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 9621/10080 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 08:03:57,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-47.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 1cfc7ddeb243a6fbee63082d52fa8fcfb4ff8d84616bad6a23c283e264c1cd83 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:03:59,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:03:59,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:03:59,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:03:59,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:03:59,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:03:59,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:03:59,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:03:59,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:03:59,143 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:03:59,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:03:59,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:03:59,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:03:59,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:03:59,144 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:03:59,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:03:59,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:03:59,145 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:03:59,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:03:59,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:03:59,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:03:59,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:03:59,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:03:59,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:03:59,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:03:59,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:03:59,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:03:59,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:03:59,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:03:59,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:03:59,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:03:59,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:03:59,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:03:59,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:03:59,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:03:59,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:03:59,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:03:59,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:03:59,151 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:03:59,151 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:03:59,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:03:59,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:03:59,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:03:59,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:03:59,154 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 -> 1cfc7ddeb243a6fbee63082d52fa8fcfb4ff8d84616bad6a23c283e264c1cd83 [2024-11-20 08:03:59,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:03:59,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:03:59,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:03:59,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:03:59,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:03:59,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-47.i [2024-11-20 08:04:00,658 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:04:00,850 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:04:00,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-47.i [2024-11-20 08:04:00,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141967d29/1032537fffbd474ea02bfb5c5531dd10/FLAGca8f2c448 [2024-11-20 08:04:00,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141967d29/1032537fffbd474ea02bfb5c5531dd10 [2024-11-20 08:04:00,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:04:00,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:04:00,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:04:00,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:04:00,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:04:00,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:04:00" (1/1) ... [2024-11-20 08:04:00,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3836cc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:00, skipping insertion in model container [2024-11-20 08:04:00,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:04:00" (1/1) ... [2024-11-20 08:04:00,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:04:01,066 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_amount50_file-47.i[915,928] [2024-11-20 08:04:01,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:04:01,141 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:04:01,154 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_amount50_file-47.i[915,928] [2024-11-20 08:04:01,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:04:01,195 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:04:01,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01 WrapperNode [2024-11-20 08:04:01,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:04:01,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:04:01,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:04:01,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:04:01,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,251 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-20 08:04:01,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:04:01,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:04:01,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:04:01,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:04:01,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,285 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 08:04:01,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:04:01,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:04:01,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:04:01,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:04:01,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (1/1) ... [2024-11-20 08:04:01,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:04:01,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:04:01,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:04:01,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:04:01,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:04:01,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:04:01,389 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:04:01,389 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:04:01,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:04:01,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:04:01,459 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:04:01,462 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:04:11,596 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 08:04:11,597 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:04:11,606 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:04:11,610 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:04:11,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:04:11 BoogieIcfgContainer [2024-11-20 08:04:11,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:04:11,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:04:11,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:04:11,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:04:11,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:04:00" (1/3) ... [2024-11-20 08:04:11,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7a4c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:04:11, skipping insertion in model container [2024-11-20 08:04:11,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:04:01" (2/3) ... [2024-11-20 08:04:11,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7a4c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:04:11, skipping insertion in model container [2024-11-20 08:04:11,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:04:11" (3/3) ... [2024-11-20 08:04:11,619 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-47.i [2024-11-20 08:04:11,631 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:04:11,631 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:04:11,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:04:11,683 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;@32fb3b1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:04:11,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:04:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 08:04:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 08:04:11,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:04:11,698 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:04:11,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:04:11,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:04:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 742321370, now seen corresponding path program 1 times [2024-11-20 08:04:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:04:11,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829342497] [2024-11-20 08:04:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:04:11,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:04:11,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:04:11,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:04:11,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 08:04:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:04:12,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 08:04:12,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:04:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-20 08:04:14,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:04:15,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:04:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829342497] [2024-11-20 08:04:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829342497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:04:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1410060065] [2024-11-20 08:04:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:04:15,305 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:04:15,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:04:15,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:04:15,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-20 08:04:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:04:16,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 08:04:16,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:04:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:04:19,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:04:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1410060065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:04:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:04:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-20 08:04:19,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643711633] [2024-11-20 08:04:19,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:04:19,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:04:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:04:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:04:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:04:19,351 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:04:24,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:04:27,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:04:32,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:04:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:04:32,471 INFO L93 Difference]: Finished difference Result 291 states and 542 transitions. [2024-11-20 08:04:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:04:32,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-11-20 08:04:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:04:32,481 INFO L225 Difference]: With dead ends: 291 [2024-11-20 08:04:32,482 INFO L226 Difference]: Without dead ends: 228 [2024-11-20 08:04:32,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:04:32,487 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 133 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:04:32,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 472 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 34 Invalid, 2 Unknown, 0 Unchecked, 12.7s Time] [2024-11-20 08:04:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-20 08:04:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 131. [2024-11-20 08:04:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 08:04:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2024-11-20 08:04:32,551 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 136 [2024-11-20 08:04:32,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:04:32,553 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2024-11-20 08:04:32,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:04:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2024-11-20 08:04:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 08:04:32,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:04:32,556 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:04:32,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 08:04:32,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-20 08:04:32,957 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,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 08:04:32,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:04:32,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:04:32,958 INFO L85 PathProgramCache]: Analyzing trace with hash -268795880, now seen corresponding path program 1 times [2024-11-20 08:04:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:04:32,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344715022] [2024-11-20 08:04:32,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:04:32,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:04:32,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:04:32,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:04:32,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 08:04:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:04:33,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 08:04:33,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:04:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 08:04:40,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:04:40,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:04:40,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344715022] [2024-11-20 08:04:40,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344715022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:04:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:04:40,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:04:40,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709870911] [2024-11-20 08:04:40,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:04:40,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:04:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:04:40,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:04:40,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:04:40,711 INFO L87 Difference]: Start difference. First operand 131 states and 197 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 08:04:45,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:04:49,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:04:53,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:04:57,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:05:02,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:05:06,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:05:10,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []