./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.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 8c68e7f909dde8700553fab87bbeaa91d2497338979474d785c0ae04bfaf91cb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:53:04,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:53:04,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:53:04,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:53:04,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:53:04,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:53:04,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:53:04,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:53:04,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:53:04,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:53:04,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:53:04,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:53:04,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:53:04,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:53:04,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:53:04,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:53:04,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:53:04,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:53:04,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:53:04,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:53:04,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:53:04,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:53:04,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:53:04,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:53:04,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:53:04,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:53:04,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:53:04,183 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:53:04,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:53:04,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:53:04,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:53:04,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:53:04,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:53:04,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:53:04,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:53:04,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:53:04,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:53:04,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:53:04,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:53:04,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:53:04,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:53:04,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:53:04,188 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 -> 8c68e7f909dde8700553fab87bbeaa91d2497338979474d785c0ae04bfaf91cb [2024-11-12 06:53:04,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:53:04,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:53:04,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:53:04,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:53:04,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:53:04,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i [2024-11-12 06:53:05,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:53:06,095 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:53:06,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i [2024-11-12 06:53:06,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6718c0b/98a12b4120974a17883d736dbee970ec/FLAG64aea0e27 [2024-11-12 06:53:06,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6718c0b/98a12b4120974a17883d736dbee970ec [2024-11-12 06:53:06,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:53:06,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:53:06,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:53:06,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:53:06,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:53:06,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28165380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06, skipping insertion in model container [2024-11-12 06:53:06,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:53:06,351 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-84.i[915,928] [2024-11-12 06:53:06,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:53:06,423 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:53:06,433 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-84.i[915,928] [2024-11-12 06:53:06,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:53:06,547 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:53:06,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06 WrapperNode [2024-11-12 06:53:06,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:53:06,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:53:06,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:53:06,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:53:06,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,611 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-12 06:53:06,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:53:06,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:53:06,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:53:06,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:53:06,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,656 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-12 06:53:06,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:53:06,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:53:06,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:53:06,692 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:53:06,693 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (1/1) ... [2024-11-12 06:53:06,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:53:06,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:53:06,728 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-12 06:53:06,735 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-12 06:53:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:53:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:53:06,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:53:06,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:53:06,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:53:06,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:53:06,852 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:53:06,853 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:53:07,250 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-12 06:53:07,250 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:53:07,262 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:53:07,262 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:53:07,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:07 BoogieIcfgContainer [2024-11-12 06:53:07,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:53:07,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:53:07,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:53:07,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:53:07,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:53:06" (1/3) ... [2024-11-12 06:53:07,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ed1b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:53:07, skipping insertion in model container [2024-11-12 06:53:07,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:06" (2/3) ... [2024-11-12 06:53:07,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ed1b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:53:07, skipping insertion in model container [2024-11-12 06:53:07,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:07" (3/3) ... [2024-11-12 06:53:07,272 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-84.i [2024-11-12 06:53:07,286 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:53:07,287 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:53:07,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:53:07,345 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;@57fcfc7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:53:07,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:53:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:53:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 06:53:07,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:07,361 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:07,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:07,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:07,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1756229400, now seen corresponding path program 1 times [2024-11-12 06:53:07,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:07,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596348971] [2024-11-12 06:53:07,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:53:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:53:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:53:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:53:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:53:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 06:53:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 06:53:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 06:53:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 06:53:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 06:53:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 06:53:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:53:07,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:07,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596348971] [2024-11-12 06:53:07,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596348971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:07,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:07,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:53:07,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442835677] [2024-11-12 06:53:07,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:07,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:53:07,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:07,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:53:07,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:53:07,835 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 06:53:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:07,862 INFO L93 Difference]: Finished difference Result 155 states and 262 transitions. [2024-11-12 06:53:07,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:53:07,865 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2024-11-12 06:53:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:07,873 INFO L225 Difference]: With dead ends: 155 [2024-11-12 06:53:07,874 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 06:53:07,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-12 06:53:07,880 INFO L435 NwaCegarLoop]: 116 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, 116 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-12 06:53:07,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:53:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 06:53:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-12 06:53:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:53:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2024-11-12 06:53:07,920 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 145 [2024-11-12 06:53:07,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:07,921 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2024-11-12 06:53:07,921 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 06:53:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2024-11-12 06:53:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 06:53:07,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:07,927 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:07,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:53:07,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:07,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash 394550616, now seen corresponding path program 1 times [2024-11-12 06:53:07,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:07,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911065556] [2024-11-12 06:53:07,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:07,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:53:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:53:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:53:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:53:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:53:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 06:53:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 06:53:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 06:53:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 06:53:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 06:53:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 06:53:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:53:08,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:08,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911065556] [2024-11-12 06:53:08,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911065556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:08,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:08,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:53:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735940814] [2024-11-12 06:53:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:08,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:53:08,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:08,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:53:08,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:53:08,506 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:08,547 INFO L93 Difference]: Finished difference Result 151 states and 229 transitions. [2024-11-12 06:53:08,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:53:08,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-12 06:53:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:08,550 INFO L225 Difference]: With dead ends: 151 [2024-11-12 06:53:08,553 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 06:53:08,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:53:08,555 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:08,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:53:08,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 06:53:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-12 06:53:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:53:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-12 06:53:08,578 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 145 [2024-11-12 06:53:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:08,580 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-12 06:53:08,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-12 06:53:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 06:53:08,584 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:08,585 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:08,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:53:08,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:08,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash 652716054, now seen corresponding path program 1 times [2024-11-12 06:53:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:08,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391166078] [2024-11-12 06:53:08,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:08,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:53:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:53:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:53:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:53:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:53:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 06:53:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 06:53:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 06:53:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 06:53:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 06:53:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 06:53:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:53:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391166078] [2024-11-12 06:53:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391166078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:53:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405924553] [2024-11-12 06:53:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:53:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:11,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:53:12,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:53:12,001 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:12,823 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2024-11-12 06:53:12,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:53:12,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-12 06:53:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:12,828 INFO L225 Difference]: With dead ends: 186 [2024-11-12 06:53:12,828 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 06:53:12,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:53:12,833 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 69 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:12,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 395 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:53:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 06:53:12,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-11-12 06:53:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.325) internal successors, (106), 81 states have internal predecessors, (106), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 06:53:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2024-11-12 06:53:12,854 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 145 [2024-11-12 06:53:12,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:12,854 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2024-11-12 06:53:12,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:12,855 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2024-11-12 06:53:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 06:53:12,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:12,857 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:12,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:53:12,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:12,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:12,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1697318672, now seen corresponding path program 1 times [2024-11-12 06:53:12,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:12,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202291333] [2024-11-12 06:53:12,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:12,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:53:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:53:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:53:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:53:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:53:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 06:53:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 06:53:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 06:53:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 06:53:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 06:53:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 06:53:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:53:13,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202291333] [2024-11-12 06:53:13,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202291333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:13,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:13,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:53:13,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665304832] [2024-11-12 06:53:13,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:13,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:53:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:53:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:53:13,999 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:14,280 INFO L93 Difference]: Finished difference Result 247 states and 354 transitions. [2024-11-12 06:53:14,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:53:14,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-12 06:53:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:14,284 INFO L225 Difference]: With dead ends: 247 [2024-11-12 06:53:14,286 INFO L226 Difference]: Without dead ends: 141 [2024-11-12 06:53:14,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:53:14,288 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 68 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:14,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 459 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:53:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-12 06:53:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-11-12 06:53:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.320754716981132) internal successors, (140), 108 states have internal predecessors, (140), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 06:53:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-11-12 06:53:14,318 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 146 [2024-11-12 06:53:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:14,318 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-11-12 06:53:14,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-11-12 06:53:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 06:53:14,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:14,321 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:14,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:53:14,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:14,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:14,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1586531374, now seen corresponding path program 1 times [2024-11-12 06:53:14,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:14,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238049968] [2024-11-12 06:53:14,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:53:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:53:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:53:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:53:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:53:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 06:53:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 06:53:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 06:53:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 06:53:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 06:53:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 06:53:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:53:14,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:14,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238049968] [2024-11-12 06:53:14,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238049968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:14,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:14,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:53:14,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516553682] [2024-11-12 06:53:14,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:14,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:53:14,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:14,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:53:14,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:53:14,915 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:15,230 INFO L93 Difference]: Finished difference Result 289 states and 404 transitions. [2024-11-12 06:53:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:53:15,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-12 06:53:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:15,233 INFO L225 Difference]: With dead ends: 289 [2024-11-12 06:53:15,233 INFO L226 Difference]: Without dead ends: 154 [2024-11-12 06:53:15,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:53:15,238 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 44 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:15,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 489 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:53:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-12 06:53:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2024-11-12 06:53:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 90 states have internal predecessors, (113), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 06:53:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2024-11-12 06:53:15,263 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 146 [2024-11-12 06:53:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:15,263 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2024-11-12 06:53:15,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2024-11-12 06:53:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 06:53:15,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:15,266 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:15,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:53:15,266 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:15,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash -14262287, now seen corresponding path program 1 times [2024-11-12 06:53:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229490674] [2024-11-12 06:53:15,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:53:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:53:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:53:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:53:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:53:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 06:53:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 06:53:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 06:53:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 06:53:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 06:53:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 06:53:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:53:19,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:19,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229490674] [2024-11-12 06:53:19,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229490674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:19,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:19,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 06:53:19,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504571851] [2024-11-12 06:53:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:19,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 06:53:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 06:53:19,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:53:19,703 INFO L87 Difference]: Start difference. First operand 121 states and 169 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:21,087 INFO L93 Difference]: Finished difference Result 328 states and 457 transitions. [2024-11-12 06:53:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 06:53:21,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-12 06:53:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:21,091 INFO L225 Difference]: With dead ends: 328 [2024-11-12 06:53:21,093 INFO L226 Difference]: Without dead ends: 218 [2024-11-12 06:53:21,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-12 06:53:21,094 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 72 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:21,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 554 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 06:53:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-12 06:53:21,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 152. [2024-11-12 06:53:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 121 states have internal predecessors, (156), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 06:53:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2024-11-12 06:53:21,117 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 147 [2024-11-12 06:53:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:21,118 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2024-11-12 06:53:21,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2024-11-12 06:53:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 06:53:21,120 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:21,120 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:21,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 06:53:21,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:21,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:21,121 INFO L85 PathProgramCache]: Analyzing trace with hash 686802291, now seen corresponding path program 1 times [2024-11-12 06:53:21,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:21,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656583650] [2024-11-12 06:53:21,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:21,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:53:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:53:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:53:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:53:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:53:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 06:53:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 06:53:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 06:53:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 06:53:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 06:53:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 06:53:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:53:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:26,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656583650] [2024-11-12 06:53:26,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656583650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:26,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:26,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 06:53:26,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401965924] [2024-11-12 06:53:26,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:26,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 06:53:26,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:26,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 06:53:26,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-12 06:53:26,349 INFO L87 Difference]: Start difference. First operand 152 states and 212 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:27,798 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2024-11-12 06:53:27,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 06:53:27,799 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-12 06:53:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:27,801 INFO L225 Difference]: With dead ends: 365 [2024-11-12 06:53:27,801 INFO L226 Difference]: Without dead ends: 224 [2024-11-12 06:53:27,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-12 06:53:27,802 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 119 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:27,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 676 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 06:53:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-12 06:53:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2024-11-12 06:53:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 121 states have internal predecessors, (156), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 06:53:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2024-11-12 06:53:27,819 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 147 [2024-11-12 06:53:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:27,819 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2024-11-12 06:53:27,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2024-11-12 06:53:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 06:53:27,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:27,822 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:27,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 06:53:27,822 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:27,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash 341528847, now seen corresponding path program 1 times [2024-11-12 06:53:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391330140] [2024-11-12 06:53:27,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:53:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:53:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:53:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:53:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:53:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 06:53:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 06:53:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 06:53:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 06:53:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 06:53:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 06:53:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:53:27,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:27,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391330140] [2024-11-12 06:53:27,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391330140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:27,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:27,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:53:27,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036576453] [2024-11-12 06:53:27,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:27,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:53:27,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:53:27,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:53:27,949 INFO L87 Difference]: Start difference. First operand 152 states and 212 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:28,054 INFO L93 Difference]: Finished difference Result 360 states and 500 transitions. [2024-11-12 06:53:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:53:28,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-12 06:53:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:28,056 INFO L225 Difference]: With dead ends: 360 [2024-11-12 06:53:28,056 INFO L226 Difference]: Without dead ends: 219 [2024-11-12 06:53:28,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:53:28,058 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 39 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:28,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 173 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:53:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-12 06:53:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 188. [2024-11-12 06:53:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.3161290322580645) internal successors, (204), 157 states have internal predecessors, (204), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 06:53:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 260 transitions. [2024-11-12 06:53:28,074 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 260 transitions. Word has length 148 [2024-11-12 06:53:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:28,074 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 260 transitions. [2024-11-12 06:53:28,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 260 transitions. [2024-11-12 06:53:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 06:53:28,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:28,076 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:28,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 06:53:28,077 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:28,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1974933933, now seen corresponding path program 1 times [2024-11-12 06:53:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:28,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979039930] [2024-11-12 06:53:28,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:53:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:53:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:53:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:53:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:53:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 06:53:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 06:53:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 06:53:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 06:53:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 06:53:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 06:53:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:53:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979039930] [2024-11-12 06:53:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979039930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:28,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:53:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665370990] [2024-11-12 06:53:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:28,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:53:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:28,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:53:28,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:53:28,309 INFO L87 Difference]: Start difference. First operand 188 states and 260 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:28,479 INFO L93 Difference]: Finished difference Result 521 states and 722 transitions. [2024-11-12 06:53:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:53:28,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-12 06:53:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:28,483 INFO L225 Difference]: With dead ends: 521 [2024-11-12 06:53:28,483 INFO L226 Difference]: Without dead ends: 336 [2024-11-12 06:53:28,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:53:28,484 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 88 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:28,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 383 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:53:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-12 06:53:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 236. [2024-11-12 06:53:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 178 states have (on average 1.2808988764044944) internal successors, (228), 180 states have internal predecessors, (228), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 06:53:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 328 transitions. [2024-11-12 06:53:28,509 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 328 transitions. Word has length 148 [2024-11-12 06:53:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:28,509 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 328 transitions. [2024-11-12 06:53:28,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2024-11-12 06:53:28,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 06:53:28,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:28,511 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:28,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 06:53:28,512 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:28,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1687224997, now seen corresponding path program 1 times [2024-11-12 06:53:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:28,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106114880] [2024-11-12 06:53:28,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:28,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:53:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:53:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:53:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:53:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:53:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:53:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:53:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:53:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:53:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:53:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:53:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:53:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:53:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:53:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:53:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:53:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 06:53:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 06:53:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 06:53:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 06:53:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 06:53:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 06:53:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:53:28,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:53:28,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106114880] [2024-11-12 06:53:28,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106114880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:28,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:28,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:53:28,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476883127] [2024-11-12 06:53:28,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:28,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:53:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:53:28,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:53:28,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:53:28,610 INFO L87 Difference]: Start difference. First operand 236 states and 328 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:28,706 INFO L93 Difference]: Finished difference Result 448 states and 615 transitions. [2024-11-12 06:53:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:53:28,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-12 06:53:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:28,710 INFO L225 Difference]: With dead ends: 448 [2024-11-12 06:53:28,710 INFO L226 Difference]: Without dead ends: 263 [2024-11-12 06:53:28,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:53:28,712 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 46 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:28,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 193 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:53:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-12 06:53:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 221. [2024-11-12 06:53:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 165 states have (on average 1.2666666666666666) internal successors, (209), 166 states have internal predecessors, (209), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 06:53:28,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 305 transitions. [2024-11-12 06:53:28,738 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 305 transitions. Word has length 148 [2024-11-12 06:53:28,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:28,739 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 305 transitions. [2024-11-12 06:53:28,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 305 transitions. [2024-11-12 06:53:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-12 06:53:28,741 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:28,742 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:28,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 06:53:28,742 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:28,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1655306804, now seen corresponding path program 1 times [2024-11-12 06:53:28,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:53:28,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945297012] [2024-11-12 06:53:28,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:28,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:53:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 06:53:28,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970327654] [2024-11-12 06:53:28,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:28,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:53:28,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:53:28,829 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-12 06:53:28,830 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-12 06:53:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:53:29,040 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:53:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:53:29,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:53:29,206 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:53:29,207 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:53:29,228 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-12 06:53:29,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 06:53:29,413 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:53:29,543 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:53:29,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:53:29 BoogieIcfgContainer [2024-11-12 06:53:29,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:53:29,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:53:29,547 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:53:29,547 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:53:29,547 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:07" (3/4) ... [2024-11-12 06:53:29,549 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:53:29,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:53:29,550 INFO L158 Benchmark]: Toolchain (without parser) took 23422.54ms. Allocated memory was 169.9MB in the beginning and 408.9MB in the end (delta: 239.1MB). Free memory was 101.7MB in the beginning and 224.0MB in the end (delta: -122.3MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. [2024-11-12 06:53:29,550 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:53:29,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.26ms. Allocated memory is still 169.9MB. Free memory was 101.4MB in the beginning and 141.5MB in the end (delta: -40.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-12 06:53:29,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.71ms. Allocated memory is still 169.9MB. Free memory was 141.5MB in the beginning and 137.7MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:53:29,551 INFO L158 Benchmark]: Boogie Preprocessor took 74.12ms. Allocated memory is still 169.9MB. Free memory was 137.7MB in the beginning and 132.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:53:29,552 INFO L158 Benchmark]: RCFGBuilder took 572.54ms. Allocated memory is still 169.9MB. Free memory was 132.8MB in the beginning and 106.9MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 06:53:29,552 INFO L158 Benchmark]: TraceAbstraction took 22280.91ms. Allocated memory was 169.9MB in the beginning and 408.9MB in the end (delta: 239.1MB). Free memory was 106.3MB in the beginning and 225.1MB in the end (delta: -118.8MB). Peak memory consumption was 122.6MB. Max. memory is 16.1GB. [2024-11-12 06:53:29,552 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 408.9MB. Free memory was 225.1MB in the beginning and 224.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:53:29,553 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.26ms. Allocated memory is still 169.9MB. Free memory was 101.4MB in the beginning and 141.5MB in the end (delta: -40.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.71ms. Allocated memory is still 169.9MB. Free memory was 141.5MB in the beginning and 137.7MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.12ms. Allocated memory is still 169.9MB. Free memory was 137.7MB in the beginning and 132.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 572.54ms. Allocated memory is still 169.9MB. Free memory was 132.8MB in the beginning and 106.9MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 22280.91ms. Allocated memory was 169.9MB in the beginning and 408.9MB in the end (delta: 239.1MB). Free memory was 106.3MB in the beginning and 225.1MB in the end (delta: -118.8MB). Peak memory consumption was 122.6MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 408.9MB. Free memory was 225.1MB in the beginning and 224.0MB in the end (delta: 1.0MB). 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 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L92] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L96] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L97] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L98] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L106] var_1_16 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L108] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L109] var_1_17 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L110] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L111] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L127] RET updateVariables() [L128] CALL step() [L45] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L45] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L50] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L52] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L52] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L53] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L54] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L58] signed long int stepLocal_1 = -4; [L59] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L60] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L65] var_1_18 = var_1_17 [L66] var_1_19 = 0 [L67] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L68] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L71] COND TRUE var_1_3 <= var_1_1 [L72] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L76] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32768, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L77] COND TRUE (~ var_1_3) < stepLocal_2 [L78] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119-L120] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 11, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 658 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 658 mSDsluCounter, 3550 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2444 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1429 IncrementalHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 1106 mSDtfsCounter, 1429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 350 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 1763 NumberOfCodeBlocks, 1763 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1455 ConstructedInterpolants, 0 QuantifiedInterpolants, 6174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 9240/9240 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-12 06:53:29,627 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.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 8c68e7f909dde8700553fab87bbeaa91d2497338979474d785c0ae04bfaf91cb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:53:31,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:53:31,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:53:31,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:53:31,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:53:31,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:53:32,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:53:32,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:53:32,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:53:32,003 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:53:32,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:53:32,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:53:32,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:53:32,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:53:32,007 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:53:32,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:53:32,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:53:32,007 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:53:32,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:53:32,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:53:32,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:53:32,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:53:32,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:53:32,012 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:53:32,015 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:53:32,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:53:32,016 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:53:32,016 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:53:32,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:53:32,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:53:32,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:53:32,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:53:32,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:53:32,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:53:32,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:53:32,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:53:32,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:53:32,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:53:32,019 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:53:32,019 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:53:32,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:53:32,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:53:32,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:53:32,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:53:32,021 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 -> 8c68e7f909dde8700553fab87bbeaa91d2497338979474d785c0ae04bfaf91cb [2024-11-12 06:53:32,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:53:32,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:53:32,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:53:32,376 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:53:32,376 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:53:32,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i [2024-11-12 06:53:33,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:53:34,161 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:53:34,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i [2024-11-12 06:53:34,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3115c085c/892c37e561c444fb8440ce10117bf2d2/FLAG24104bc22 [2024-11-12 06:53:34,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3115c085c/892c37e561c444fb8440ce10117bf2d2 [2024-11-12 06:53:34,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:53:34,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:53:34,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:53:34,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:53:34,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:53:34,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6981b531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34, skipping insertion in model container [2024-11-12 06:53:34,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:53:34,420 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-84.i[915,928] [2024-11-12 06:53:34,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:53:34,526 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:53:34,538 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-84.i[915,928] [2024-11-12 06:53:34,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:53:34,603 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:53:34,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34 WrapperNode [2024-11-12 06:53:34,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:53:34,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:53:34,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:53:34,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:53:34,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,663 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-12 06:53:34,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:53:34,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:53:34,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:53:34,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:53:34,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,706 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-12 06:53:34,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:53:34,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:53:34,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:53:34,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:53:34,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (1/1) ... [2024-11-12 06:53:34,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:53:34,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:53:34,767 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-12 06:53:34,769 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-12 06:53:34,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:53:34,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:53:34,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:53:34,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:53:34,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:53:34,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:53:34,894 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:53:34,897 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:53:35,381 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 06:53:35,382 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:53:35,398 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:53:35,399 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:53:35,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:35 BoogieIcfgContainer [2024-11-12 06:53:35,400 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:53:35,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:53:35,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:53:35,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:53:35,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:53:34" (1/3) ... [2024-11-12 06:53:35,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef755f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:53:35, skipping insertion in model container [2024-11-12 06:53:35,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:53:34" (2/3) ... [2024-11-12 06:53:35,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef755f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:53:35, skipping insertion in model container [2024-11-12 06:53:35,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:53:35" (3/3) ... [2024-11-12 06:53:35,411 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-84.i [2024-11-12 06:53:35,430 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:53:35,430 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:53:35,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:53:35,510 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;@2ff19bee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:53:35,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:53:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:53:35,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 06:53:35,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:35,529 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:35,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:35,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2103567624, now seen corresponding path program 1 times [2024-11-12 06:53:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:53:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435360921] [2024-11-12 06:53:35,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:35,553 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-12 06:53:35,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:53:35,558 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-12 06:53:35,559 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-12 06:53:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:35,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:53:35,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:53:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-12 06:53:35,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:53:35,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:53:35,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435360921] [2024-11-12 06:53:35,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435360921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:35,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:53:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008660070] [2024-11-12 06:53:35,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:35,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:53:35,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:53:35,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:53:35,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:53:35,936 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 06:53:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:35,963 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-11-12 06:53:35,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:53:35,965 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-12 06:53:35,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:35,974 INFO L225 Difference]: With dead ends: 119 [2024-11-12 06:53:35,974 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 06:53:35,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-12 06:53:35,981 INFO L435 NwaCegarLoop]: 88 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, 88 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-12 06:53:35,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:53:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 06:53:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 06:53:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:53:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2024-11-12 06:53:36,022 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 139 [2024-11-12 06:53:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:36,022 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2024-11-12 06:53:36,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 06:53:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-11-12 06:53:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 06:53:36,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:36,026 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:36,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 06:53:36,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:53:36,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:36,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:36,233 INFO L85 PathProgramCache]: Analyzing trace with hash -176932552, now seen corresponding path program 1 times [2024-11-12 06:53:36,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:53:36,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285100433] [2024-11-12 06:53:36,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:36,235 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-12 06:53:36,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:53:36,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:53:36,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 06:53:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:36,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 06:53:36,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:53:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:53:36,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:53:36,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:53:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285100433] [2024-11-12 06:53:36,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285100433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:53:36,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:53:36,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:53:36,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721118602] [2024-11-12 06:53:36,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:53:36,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:53:36,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:53:36,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:53:36,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:53:36,512 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:53:36,595 INFO L93 Difference]: Finished difference Result 115 states and 173 transitions. [2024-11-12 06:53:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:53:36,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-11-12 06:53:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:53:36,610 INFO L225 Difference]: With dead ends: 115 [2024-11-12 06:53:36,610 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 06:53:36,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:53:36,614 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:53:36,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:53:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 06:53:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 06:53:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:53:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-11-12 06:53:36,637 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 139 [2024-11-12 06:53:36,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:53:36,639 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-11-12 06:53:36,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:53:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-12 06:53:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 06:53:36,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:53:36,643 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:53:36,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 06:53:36,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:53:36,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:53:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:53:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash -986279178, now seen corresponding path program 1 times [2024-11-12 06:53:36,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:53:36,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108340645] [2024-11-12 06:53:36,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:53:36,847 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-12 06:53:36,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:53:36,851 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-12 06:53:36,852 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-12 06:53:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:53:37,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 06:53:37,055 INFO L279 TraceCheckSpWp]: Computing forward predicates...