./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.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_variablewrapping_wrapper-s_file-3.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 16590e9bc433910605f5e4d8182c46930e3c9f2a76ed7e606268a246ee561bc1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:39:51,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:39:51,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:39:51,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:39:51,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:39:51,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:39:51,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:39:51,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:39:51,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:39:51,809 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:39:51,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:39:51,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:39:51,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:39:51,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:39:51,814 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:39:51,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:39:51,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:39:51,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:39:51,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:39:51,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:39:51,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:39:51,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:39:51,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:39:51,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:39:51,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:39:51,820 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:39:51,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:39:51,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:39:51,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:39:51,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:39:51,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:39:51,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:39:51,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:51,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:39:51,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:39:51,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:39:51,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:39:51,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:39:51,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:39:51,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:39:51,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:39:51,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:39:51,842 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 -> 16590e9bc433910605f5e4d8182c46930e3c9f2a76ed7e606268a246ee561bc1 [2024-11-12 07:39:52,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:39:52,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:39:52,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:39:52,166 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:39:52,167 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:39:52,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i [2024-11-12 07:39:53,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:39:53,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:39:53,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i [2024-11-12 07:39:53,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc131bdd/cc47119538254c1b921611f22aa021d0/FLAG6fd54b30a [2024-11-12 07:39:53,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc131bdd/cc47119538254c1b921611f22aa021d0 [2024-11-12 07:39:53,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:39:53,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:39:53,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:53,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:39:53,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:39:53,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:53" (1/1) ... [2024-11-12 07:39:53,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bdbe580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:53, skipping insertion in model container [2024-11-12 07:39:53,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:53" (1/1) ... [2024-11-12 07:39:54,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:39:54,202 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_variablewrapping_wrapper-s_file-3.i[915,928] [2024-11-12 07:39:54,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:54,273 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:39:54,287 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_variablewrapping_wrapper-s_file-3.i[915,928] [2024-11-12 07:39:54,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:54,358 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:39:54,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54 WrapperNode [2024-11-12 07:39:54,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:54,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:54,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:39:54,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:39:54,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,416 INFO L138 Inliner]: procedures = 30, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 627 [2024-11-12 07:39:54,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:54,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:39:54,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:39:54,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:39:54,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,448 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:39:54,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:39:54,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:39:54,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:39:54,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:39:54,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (1/1) ... [2024-11-12 07:39:54,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:54,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:39:54,541 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 07:39:54,544 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 07:39:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:39:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:39:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:39:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:39:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:39:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:39:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:39:54,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:39:54,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:39:54,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:39:54,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:39:54,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:39:54,751 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:39:54,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:39:55,510 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-12 07:39:55,511 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:39:55,530 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:39:55,532 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:39:55,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:55 BoogieIcfgContainer [2024-11-12 07:39:55,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:39:55,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:39:55,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:39:55,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:39:55,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:39:53" (1/3) ... [2024-11-12 07:39:55,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4ad60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:55, skipping insertion in model container [2024-11-12 07:39:55,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:54" (2/3) ... [2024-11-12 07:39:55,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4ad60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:55, skipping insertion in model container [2024-11-12 07:39:55,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:55" (3/3) ... [2024-11-12 07:39:55,544 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-3.i [2024-11-12 07:39:55,562 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:39:55,563 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:39:55,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:39:55,647 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;@3d3ecac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:39:55,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:39:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:39:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:39:55,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:55,670 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:39:55,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:55,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1212346061, now seen corresponding path program 1 times [2024-11-12 07:39:55,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:55,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643279354] [2024-11-12 07:39:55,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:55,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:39:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:39:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:39:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:39:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:39:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:39:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:39:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:56,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643279354] [2024-11-12 07:39:56,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643279354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:56,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:39:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821597289] [2024-11-12 07:39:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:56,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:39:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:39:56,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:56,696 INFO L87 Difference]: Start difference. First operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:39:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:56,788 INFO L93 Difference]: Finished difference Result 293 states and 457 transitions. [2024-11-12 07:39:56,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:39:56,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-12 07:39:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:56,804 INFO L225 Difference]: With dead ends: 293 [2024-11-12 07:39:56,805 INFO L226 Difference]: Without dead ends: 147 [2024-11-12 07:39:56,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:56,816 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:56,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-12 07:39:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-12 07:39:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:39:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-11-12 07:39:56,865 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2024-11-12 07:39:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:56,867 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-11-12 07:39:56,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:39:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-11-12 07:39:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:39:56,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:56,872 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:39:56,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:39:56,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:56,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash -500527483, now seen corresponding path program 1 times [2024-11-12 07:39:56,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:56,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085249182] [2024-11-12 07:39:56,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:39:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:39:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:39:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:39:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:39:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:39:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:39:57,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:57,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085249182] [2024-11-12 07:39:57,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085249182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:57,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:57,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:57,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801976787] [2024-11-12 07:39:57,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:57,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:57,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:57,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:57,143 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:39:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:57,211 INFO L93 Difference]: Finished difference Result 368 states and 546 transitions. [2024-11-12 07:39:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:57,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-12 07:39:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:57,215 INFO L225 Difference]: With dead ends: 368 [2024-11-12 07:39:57,215 INFO L226 Difference]: Without dead ends: 224 [2024-11-12 07:39:57,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 07:39:57,217 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 114 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:57,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 412 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-12 07:39:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 179. [2024-11-12 07:39:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 161 states have (on average 1.453416149068323) internal successors, (234), 161 states have internal predecessors, (234), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:39:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 266 transitions. [2024-11-12 07:39:57,239 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 266 transitions. Word has length 135 [2024-11-12 07:39:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:57,240 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 266 transitions. [2024-11-12 07:39:57,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:39:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2024-11-12 07:39:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:39:57,243 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:57,243 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:39:57,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:39:57,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:57,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:57,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1678409010, now seen corresponding path program 1 times [2024-11-12 07:39:57,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:57,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191064129] [2024-11-12 07:39:57,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:39:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:39:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:39:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:39:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:39:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:39:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:39:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:59,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191064129] [2024-11-12 07:39:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191064129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:59,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:39:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551185631] [2024-11-12 07:39:59,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:59,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:39:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:59,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:39:59,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:59,133 INFO L87 Difference]: Start difference. First operand 179 states and 266 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:39:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:59,514 INFO L93 Difference]: Finished difference Result 531 states and 792 transitions. [2024-11-12 07:39:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:39:59,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-12 07:39:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:59,523 INFO L225 Difference]: With dead ends: 531 [2024-11-12 07:39:59,523 INFO L226 Difference]: Without dead ends: 355 [2024-11-12 07:39:59,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:39:59,525 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 155 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:59,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 550 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:39:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-12 07:39:59,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 347. [2024-11-12 07:39:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 312 states have (on average 1.4487179487179487) internal successors, (452), 312 states have internal predecessors, (452), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 07:39:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 516 transitions. [2024-11-12 07:39:59,568 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 516 transitions. Word has length 135 [2024-11-12 07:39:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:59,569 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 516 transitions. [2024-11-12 07:39:59,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:39:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 516 transitions. [2024-11-12 07:39:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:39:59,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:59,576 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:39:59,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:39:59,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:59,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash 741335402, now seen corresponding path program 1 times [2024-11-12 07:39:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:59,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951935102] [2024-11-12 07:39:59,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:59,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:01,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:01,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951935102] [2024-11-12 07:40:01,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951935102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:01,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:01,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:40:01,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813996627] [2024-11-12 07:40:01,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:01,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:40:01,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:01,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:40:01,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:01,445 INFO L87 Difference]: Start difference. First operand 347 states and 516 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:01,917 INFO L93 Difference]: Finished difference Result 635 states and 942 transitions. [2024-11-12 07:40:01,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:01,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-12 07:40:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:01,923 INFO L225 Difference]: With dead ends: 635 [2024-11-12 07:40:01,924 INFO L226 Difference]: Without dead ends: 459 [2024-11-12 07:40:01,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:40:01,926 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 115 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:01,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 936 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:40:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-12 07:40:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 456. [2024-11-12 07:40:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 416 states have (on average 1.4519230769230769) internal successors, (604), 417 states have internal predecessors, (604), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 07:40:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 676 transitions. [2024-11-12 07:40:01,956 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 676 transitions. Word has length 136 [2024-11-12 07:40:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:01,957 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 676 transitions. [2024-11-12 07:40:01,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 676 transitions. [2024-11-12 07:40:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 07:40:01,959 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:01,959 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:01,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:40:01,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:01,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:01,961 INFO L85 PathProgramCache]: Analyzing trace with hash -608558604, now seen corresponding path program 1 times [2024-11-12 07:40:01,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:01,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383630699] [2024-11-12 07:40:01,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:03,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:03,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383630699] [2024-11-12 07:40:03,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383630699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:03,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:03,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:40:03,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058232220] [2024-11-12 07:40:03,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:03,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:40:03,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:03,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:40:03,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:40:03,236 INFO L87 Difference]: Start difference. First operand 456 states and 676 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:03,554 INFO L93 Difference]: Finished difference Result 917 states and 1360 transitions. [2024-11-12 07:40:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:40:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-12 07:40:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:03,559 INFO L225 Difference]: With dead ends: 917 [2024-11-12 07:40:03,559 INFO L226 Difference]: Without dead ends: 464 [2024-11-12 07:40:03,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:03,562 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 147 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:03,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 545 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:40:03,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-12 07:40:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 456. [2024-11-12 07:40:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 416 states have (on average 1.4495192307692308) internal successors, (603), 417 states have internal predecessors, (603), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 07:40:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 675 transitions. [2024-11-12 07:40:03,590 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 675 transitions. Word has length 137 [2024-11-12 07:40:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:03,591 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 675 transitions. [2024-11-12 07:40:03,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 675 transitions. [2024-11-12 07:40:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 07:40:03,596 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:03,597 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:03,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:40:03,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:03,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1514344948, now seen corresponding path program 1 times [2024-11-12 07:40:03,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:03,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643527960] [2024-11-12 07:40:03,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:03,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:03,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:03,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643527960] [2024-11-12 07:40:03,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643527960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:03,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:03,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:03,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228411282] [2024-11-12 07:40:03,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:03,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:03,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:03,818 INFO L87 Difference]: Start difference. First operand 456 states and 675 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:03,860 INFO L93 Difference]: Finished difference Result 918 states and 1359 transitions. [2024-11-12 07:40:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:03,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-12 07:40:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:03,864 INFO L225 Difference]: With dead ends: 918 [2024-11-12 07:40:03,864 INFO L226 Difference]: Without dead ends: 465 [2024-11-12 07:40:03,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:03,866 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:03,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 833 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-12 07:40:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2024-11-12 07:40:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 419 states have (on average 1.4463007159904535) internal successors, (606), 420 states have internal predecessors, (606), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 07:40:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 678 transitions. [2024-11-12 07:40:03,888 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 678 transitions. Word has length 137 [2024-11-12 07:40:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:03,890 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 678 transitions. [2024-11-12 07:40:03,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 678 transitions. [2024-11-12 07:40:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 07:40:03,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:03,893 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:03,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:40:03,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:03,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:03,895 INFO L85 PathProgramCache]: Analyzing trace with hash -285582379, now seen corresponding path program 1 times [2024-11-12 07:40:03,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:03,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179935269] [2024-11-12 07:40:03,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:03,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:04,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:04,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179935269] [2024-11-12 07:40:04,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179935269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:04,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:04,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:04,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286619471] [2024-11-12 07:40:04,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:04,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:04,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:04,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:04,163 INFO L87 Difference]: Start difference. First operand 459 states and 678 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:04,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:04,207 INFO L93 Difference]: Finished difference Result 924 states and 1365 transitions. [2024-11-12 07:40:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:04,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-12 07:40:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:04,210 INFO L225 Difference]: With dead ends: 924 [2024-11-12 07:40:04,210 INFO L226 Difference]: Without dead ends: 468 [2024-11-12 07:40:04,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:04,212 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:04,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-12 07:40:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2024-11-12 07:40:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 428 states have (on average 1.4369158878504673) internal successors, (615), 429 states have internal predecessors, (615), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 07:40:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 687 transitions. [2024-11-12 07:40:04,228 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 687 transitions. Word has length 138 [2024-11-12 07:40:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:04,228 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 687 transitions. [2024-11-12 07:40:04,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 687 transitions. [2024-11-12 07:40:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 07:40:04,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:04,231 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:04,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:40:04,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:04,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:04,232 INFO L85 PathProgramCache]: Analyzing trace with hash 903635364, now seen corresponding path program 1 times [2024-11-12 07:40:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:04,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259039295] [2024-11-12 07:40:04,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:04,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:04,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259039295] [2024-11-12 07:40:04,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259039295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:04,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:04,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:40:04,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487724105] [2024-11-12 07:40:04,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:04,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:40:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:04,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:40:04,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:04,828 INFO L87 Difference]: Start difference. First operand 468 states and 687 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:05,492 INFO L93 Difference]: Finished difference Result 936 states and 1378 transitions. [2024-11-12 07:40:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:05,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-12 07:40:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:05,496 INFO L225 Difference]: With dead ends: 936 [2024-11-12 07:40:05,498 INFO L226 Difference]: Without dead ends: 643 [2024-11-12 07:40:05,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:40:05,500 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 471 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:05,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 529 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:40:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-12 07:40:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 635. [2024-11-12 07:40:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 578 states have (on average 1.4359861591695502) internal successors, (830), 579 states have internal predecessors, (830), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 07:40:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 934 transitions. [2024-11-12 07:40:05,533 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 934 transitions. Word has length 138 [2024-11-12 07:40:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:05,534 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 934 transitions. [2024-11-12 07:40:05,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 934 transitions. [2024-11-12 07:40:05,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 07:40:05,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:05,536 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:05,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:40:05,536 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:05,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:05,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1188514192, now seen corresponding path program 1 times [2024-11-12 07:40:05,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:05,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107139685] [2024-11-12 07:40:05,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:05,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:06,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:06,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107139685] [2024-11-12 07:40:06,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107139685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:06,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:06,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:40:06,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901541001] [2024-11-12 07:40:06,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:06,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:40:06,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:06,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:40:06,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:06,231 INFO L87 Difference]: Start difference. First operand 635 states and 934 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:06,856 INFO L93 Difference]: Finished difference Result 1275 states and 1876 transitions. [2024-11-12 07:40:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:06,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-12 07:40:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:06,861 INFO L225 Difference]: With dead ends: 1275 [2024-11-12 07:40:06,861 INFO L226 Difference]: Without dead ends: 757 [2024-11-12 07:40:06,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:40:06,864 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 450 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:06,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 466 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:40:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-11-12 07:40:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 749. [2024-11-12 07:40:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 674 states have (on average 1.4198813056379822) internal successors, (957), 675 states have internal predecessors, (957), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 07:40:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1093 transitions. [2024-11-12 07:40:06,903 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1093 transitions. Word has length 138 [2024-11-12 07:40:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:06,904 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1093 transitions. [2024-11-12 07:40:06,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1093 transitions. [2024-11-12 07:40:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:40:06,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:06,906 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:06,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:40:06,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:06,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash 735618990, now seen corresponding path program 1 times [2024-11-12 07:40:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:06,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236213493] [2024-11-12 07:40:06,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:08,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236213493] [2024-11-12 07:40:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236213493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:08,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:08,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:40:08,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826778998] [2024-11-12 07:40:08,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:08,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:40:08,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:08,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:40:08,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:40:08,380 INFO L87 Difference]: Start difference. First operand 749 states and 1093 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:40:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:09,613 INFO L93 Difference]: Finished difference Result 1813 states and 2636 transitions. [2024-11-12 07:40:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:40:09,614 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-12 07:40:09,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:09,618 INFO L225 Difference]: With dead ends: 1813 [2024-11-12 07:40:09,619 INFO L226 Difference]: Without dead ends: 1067 [2024-11-12 07:40:09,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:40:09,621 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 115 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:09,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1867 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 07:40:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-11-12 07:40:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 982. [2024-11-12 07:40:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 897 states have (on average 1.4202898550724639) internal successors, (1274), 900 states have internal predecessors, (1274), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-12 07:40:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1426 transitions. [2024-11-12 07:40:09,670 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1426 transitions. Word has length 139 [2024-11-12 07:40:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:09,671 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1426 transitions. [2024-11-12 07:40:09,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:40:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1426 transitions. [2024-11-12 07:40:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:40:09,673 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:09,673 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:09,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:40:09,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:09,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:09,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1436683568, now seen corresponding path program 1 times [2024-11-12 07:40:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:09,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302212610] [2024-11-12 07:40:09,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:09,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:10,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:10,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302212610] [2024-11-12 07:40:10,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302212610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:10,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:10,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203374433] [2024-11-12 07:40:10,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:10,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:10,327 INFO L87 Difference]: Start difference. First operand 982 states and 1426 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:10,834 INFO L93 Difference]: Finished difference Result 2087 states and 3021 transitions. [2024-11-12 07:40:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:10,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-12 07:40:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:10,842 INFO L225 Difference]: With dead ends: 2087 [2024-11-12 07:40:10,842 INFO L226 Difference]: Without dead ends: 1108 [2024-11-12 07:40:10,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:10,846 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 121 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:10,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 645 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:40:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-11-12 07:40:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1103. [2024-11-12 07:40:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 994 states have (on average 1.408450704225352) internal successors, (1400), 999 states have internal predecessors, (1400), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-12 07:40:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1592 transitions. [2024-11-12 07:40:10,903 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1592 transitions. Word has length 139 [2024-11-12 07:40:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:10,905 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1592 transitions. [2024-11-12 07:40:10,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1592 transitions. [2024-11-12 07:40:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:40:10,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:10,907 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:10,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:40:10,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:10,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash -82029460, now seen corresponding path program 1 times [2024-11-12 07:40:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:10,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848268089] [2024-11-12 07:40:10,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:11,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:11,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848268089] [2024-11-12 07:40:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848268089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:11,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:11,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646624128] [2024-11-12 07:40:11,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:11,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:11,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:11,529 INFO L87 Difference]: Start difference. First operand 1103 states and 1592 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:11,995 INFO L93 Difference]: Finished difference Result 2219 states and 3193 transitions. [2024-11-12 07:40:11,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:11,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-12 07:40:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:12,001 INFO L225 Difference]: With dead ends: 2219 [2024-11-12 07:40:12,001 INFO L226 Difference]: Without dead ends: 1128 [2024-11-12 07:40:12,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:12,004 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 120 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:12,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 807 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:40:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2024-11-12 07:40:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1102. [2024-11-12 07:40:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 995 states have (on average 1.406030150753769) internal successors, (1399), 999 states have internal predecessors, (1399), 92 states have call successors, (92), 14 states have call predecessors, (92), 14 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-12 07:40:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1583 transitions. [2024-11-12 07:40:12,072 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1583 transitions. Word has length 139 [2024-11-12 07:40:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:12,072 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1583 transitions. [2024-11-12 07:40:12,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1583 transitions. [2024-11-12 07:40:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:40:12,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:12,074 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:12,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:40:12,075 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:12,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash 619035118, now seen corresponding path program 1 times [2024-11-12 07:40:12,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:12,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532927288] [2024-11-12 07:40:12,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:13,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:13,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532927288] [2024-11-12 07:40:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532927288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:13,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:13,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:40:13,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250411062] [2024-11-12 07:40:13,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:13,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:40:13,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:13,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:40:13,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:40:13,365 INFO L87 Difference]: Start difference. First operand 1102 states and 1583 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:14,357 INFO L93 Difference]: Finished difference Result 2229 states and 3193 transitions. [2024-11-12 07:40:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:40:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-12 07:40:14,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:14,364 INFO L225 Difference]: With dead ends: 2229 [2024-11-12 07:40:14,364 INFO L226 Difference]: Without dead ends: 1130 [2024-11-12 07:40:14,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:40:14,368 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 113 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:14,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1643 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:40:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-11-12 07:40:14,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 912. [2024-11-12 07:40:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 823 states have (on average 1.4094775212636694) internal successors, (1160), 825 states have internal predecessors, (1160), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-12 07:40:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1312 transitions. [2024-11-12 07:40:14,424 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1312 transitions. Word has length 139 [2024-11-12 07:40:14,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:14,424 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1312 transitions. [2024-11-12 07:40:14,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1312 transitions. [2024-11-12 07:40:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:40:14,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:14,426 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:14,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:40:14,427 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:14,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:14,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1014010927, now seen corresponding path program 1 times [2024-11-12 07:40:14,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:14,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70929732] [2024-11-12 07:40:14,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:14,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:14,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:14,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70929732] [2024-11-12 07:40:14,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70929732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:14,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:14,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:40:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390348052] [2024-11-12 07:40:14,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:14,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:40:14,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:14,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:40:14,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:40:14,520 INFO L87 Difference]: Start difference. First operand 912 states and 1312 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:14,622 INFO L93 Difference]: Finished difference Result 1734 states and 2489 transitions. [2024-11-12 07:40:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:40:14,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-12 07:40:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:14,626 INFO L225 Difference]: With dead ends: 1734 [2024-11-12 07:40:14,626 INFO L226 Difference]: Without dead ends: 784 [2024-11-12 07:40:14,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 07:40:14,629 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 103 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:14,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 507 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:40:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-12 07:40:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 641. [2024-11-12 07:40:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 580 states have (on average 1.389655172413793) internal successors, (806), 581 states have internal predecessors, (806), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 07:40:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 910 transitions. [2024-11-12 07:40:14,656 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 910 transitions. Word has length 139 [2024-11-12 07:40:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:14,656 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 910 transitions. [2024-11-12 07:40:14,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 910 transitions. [2024-11-12 07:40:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:40:14,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:14,658 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:14,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:40:14,658 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:14,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:14,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1227230246, now seen corresponding path program 1 times [2024-11-12 07:40:14,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:14,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625299572] [2024-11-12 07:40:14,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:14,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:16,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:16,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625299572] [2024-11-12 07:40:16,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625299572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:16,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:16,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:40:16,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802246586] [2024-11-12 07:40:16,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:16,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:40:16,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:16,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:40:16,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:40:16,122 INFO L87 Difference]: Start difference. First operand 641 states and 910 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:40:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:17,002 INFO L93 Difference]: Finished difference Result 1319 states and 1868 transitions. [2024-11-12 07:40:17,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 07:40:17,002 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2024-11-12 07:40:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:17,006 INFO L225 Difference]: With dead ends: 1319 [2024-11-12 07:40:17,007 INFO L226 Difference]: Without dead ends: 917 [2024-11-12 07:40:17,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:40:17,008 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 226 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:17,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1101 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:40:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-12 07:40:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 908. [2024-11-12 07:40:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 840 states have (on average 1.4) internal successors, (1176), 843 states have internal predecessors, (1176), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 07:40:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1288 transitions. [2024-11-12 07:40:17,043 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1288 transitions. Word has length 140 [2024-11-12 07:40:17,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:17,043 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1288 transitions. [2024-11-12 07:40:17,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:40:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1288 transitions. [2024-11-12 07:40:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 07:40:17,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:17,046 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:17,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:40:17,047 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:17,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash -392576892, now seen corresponding path program 1 times [2024-11-12 07:40:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:17,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551610876] [2024-11-12 07:40:17,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:17,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:18,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:18,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551610876] [2024-11-12 07:40:18,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551610876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:18,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:18,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:40:18,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263681037] [2024-11-12 07:40:18,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:18,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:40:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:18,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:40:18,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:18,049 INFO L87 Difference]: Start difference. First operand 908 states and 1288 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:40:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:18,671 INFO L93 Difference]: Finished difference Result 1834 states and 2609 transitions. [2024-11-12 07:40:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:18,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2024-11-12 07:40:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:18,677 INFO L225 Difference]: With dead ends: 1834 [2024-11-12 07:40:18,677 INFO L226 Difference]: Without dead ends: 1169 [2024-11-12 07:40:18,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:40:18,679 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 108 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:18,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 632 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:40:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2024-11-12 07:40:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1075. [2024-11-12 07:40:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1007 states have (on average 1.4051638530287984) internal successors, (1415), 1010 states have internal predecessors, (1415), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 07:40:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1527 transitions. [2024-11-12 07:40:18,728 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1527 transitions. Word has length 140 [2024-11-12 07:40:18,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:18,728 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1527 transitions. [2024-11-12 07:40:18,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:40:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1527 transitions. [2024-11-12 07:40:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-12 07:40:18,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:18,732 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:18,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:40:18,732 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:18,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash 921922377, now seen corresponding path program 1 times [2024-11-12 07:40:18,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:18,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614375875] [2024-11-12 07:40:18,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-12 07:40:19,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:19,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614375875] [2024-11-12 07:40:19,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614375875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:40:19,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285806502] [2024-11-12 07:40:19,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:19,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:40:19,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:40:19,837 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 07:40:19,838 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 07:40:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:20,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-12 07:40:20,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:20,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2024-11-12 07:40:20,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 118 [2024-11-12 07:40:21,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:40:21,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:40:21,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:40:21,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:40:21,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:40:21,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:40:21,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:40:21,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:40:21,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2024-11-12 07:40:21,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2024-11-12 07:40:21,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:21,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2024-11-12 07:40:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-12 07:40:21,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:40:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-12 07:40:22,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285806502] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:40:22,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 07:40:22,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 14] total 28 [2024-11-12 07:40:22,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134589715] [2024-11-12 07:40:22,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 07:40:22,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 07:40:22,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:22,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 07:40:22,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2024-11-12 07:40:22,872 INFO L87 Difference]: Start difference. First operand 1075 states and 1527 transitions. Second operand has 28 states, 25 states have (on average 6.88) internal successors, (172), 28 states have internal predecessors, (172), 9 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 6 states have call predecessors, (48), 9 states have call successors, (48) [2024-11-12 07:40:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:25,765 INFO L93 Difference]: Finished difference Result 2473 states and 3482 transitions. [2024-11-12 07:40:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-12 07:40:25,766 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.88) internal successors, (172), 28 states have internal predecessors, (172), 9 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 6 states have call predecessors, (48), 9 states have call successors, (48) Word has length 142 [2024-11-12 07:40:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:25,772 INFO L225 Difference]: With dead ends: 2473 [2024-11-12 07:40:25,772 INFO L226 Difference]: Without dead ends: 1414 [2024-11-12 07:40:25,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 305 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=771, Invalid=4059, Unknown=0, NotChecked=0, Total=4830 [2024-11-12 07:40:25,776 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 2860 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 2988 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2861 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 3312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 2988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:25,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2861 Valid, 1818 Invalid, 3312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 2988 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-12 07:40:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-11-12 07:40:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 879. [2024-11-12 07:40:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 819 states have (on average 1.3943833943833943) internal successors, (1142), 819 states have internal predecessors, (1142), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 07:40:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1238 transitions. [2024-11-12 07:40:25,813 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1238 transitions. Word has length 142 [2024-11-12 07:40:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:25,813 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1238 transitions. [2024-11-12 07:40:25,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.88) internal successors, (172), 28 states have internal predecessors, (172), 9 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 6 states have call predecessors, (48), 9 states have call successors, (48) [2024-11-12 07:40:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1238 transitions. [2024-11-12 07:40:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-12 07:40:25,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:25,815 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:25,834 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 07:40:26,019 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,SelfDestructingSolverStorable16 [2024-11-12 07:40:26,020 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:26,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2106000864, now seen corresponding path program 1 times [2024-11-12 07:40:26,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:26,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118784615] [2024-11-12 07:40:26,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:26,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:26,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118784615] [2024-11-12 07:40:26,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118784615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:26,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:26,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:26,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806969812] [2024-11-12 07:40:26,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:26,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:26,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:26,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:26,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:26,285 INFO L87 Difference]: Start difference. First operand 879 states and 1238 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:26,574 INFO L93 Difference]: Finished difference Result 2290 states and 3224 transitions. [2024-11-12 07:40:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2024-11-12 07:40:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:26,581 INFO L225 Difference]: With dead ends: 2290 [2024-11-12 07:40:26,581 INFO L226 Difference]: Without dead ends: 1414 [2024-11-12 07:40:26,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:40:26,586 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 187 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:26,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 488 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:40:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-11-12 07:40:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 885. [2024-11-12 07:40:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 825 states have (on average 1.3915151515151516) internal successors, (1148), 825 states have internal predecessors, (1148), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 07:40:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1244 transitions. [2024-11-12 07:40:26,634 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1244 transitions. Word has length 142 [2024-11-12 07:40:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:26,635 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1244 transitions. [2024-11-12 07:40:26,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1244 transitions. [2024-11-12 07:40:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-12 07:40:26,637 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:26,637 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:26,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:40:26,637 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:26,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:26,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2054952926, now seen corresponding path program 1 times [2024-11-12 07:40:26,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:26,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876055325] [2024-11-12 07:40:26,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:26,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:27,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:27,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876055325] [2024-11-12 07:40:27,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876055325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:27,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:27,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:40:27,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636663843] [2024-11-12 07:40:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:27,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:40:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:27,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:40:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:27,329 INFO L87 Difference]: Start difference. First operand 885 states and 1244 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:27,761 INFO L93 Difference]: Finished difference Result 1923 states and 2687 transitions. [2024-11-12 07:40:27,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:27,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2024-11-12 07:40:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:27,768 INFO L225 Difference]: With dead ends: 1923 [2024-11-12 07:40:27,768 INFO L226 Difference]: Without dead ends: 1041 [2024-11-12 07:40:27,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:40:27,770 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 153 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:27,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 752 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:40:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-12 07:40:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 947. [2024-11-12 07:40:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 876 states have (on average 1.3858447488584476) internal successors, (1214), 877 states have internal predecessors, (1214), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 07:40:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1326 transitions. [2024-11-12 07:40:27,807 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1326 transitions. Word has length 142 [2024-11-12 07:40:27,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:27,808 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1326 transitions. [2024-11-12 07:40:27,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1326 transitions. [2024-11-12 07:40:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 07:40:27,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:27,810 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:27,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:40:27,811 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:27,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1938950114, now seen corresponding path program 1 times [2024-11-12 07:40:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:27,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383356873] [2024-11-12 07:40:27,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:27,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:40:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:40:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:40:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:40:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:40:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:40:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:28,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:28,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383356873] [2024-11-12 07:40:28,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383356873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:28,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:28,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:28,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771973407] [2024-11-12 07:40:28,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:28,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:28,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:28,586 INFO L87 Difference]: Start difference. First operand 947 states and 1326 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:28,889 INFO L93 Difference]: Finished difference Result 1967 states and 2750 transitions. [2024-11-12 07:40:28,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:28,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-12 07:40:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:28,894 INFO L225 Difference]: With dead ends: 1967 [2024-11-12 07:40:28,894 INFO L226 Difference]: Without dead ends: 1023 [2024-11-12 07:40:28,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:28,896 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 96 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:28,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 489 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:40:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-11-12 07:40:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 935. [2024-11-12 07:40:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 864 states have (on average 1.3831018518518519) internal successors, (1195), 865 states have internal predecessors, (1195), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 07:40:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1307 transitions. [2024-11-12 07:40:28,948 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1307 transitions. Word has length 143 [2024-11-12 07:40:28,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:28,948 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1307 transitions. [2024-11-12 07:40:28,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1307 transitions. [2024-11-12 07:40:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 07:40:28,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:28,954 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:28,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 07:40:28,954 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:28,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:28,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1104296760, now seen corresponding path program 1 times [2024-11-12 07:40:28,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:28,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307121475] [2024-11-12 07:40:28,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:40:29,037 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:40:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:40:29,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:40:29,147 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:40:29,148 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:40:29,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 07:40:29,152 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:40:29,243 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:40:29,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:40:29 BoogieIcfgContainer [2024-11-12 07:40:29,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:40:29,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:40:29,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:40:29,247 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:40:29,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:55" (3/4) ... [2024-11-12 07:40:29,250 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:40:29,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:40:29,252 INFO L158 Benchmark]: Toolchain (without parser) took 35286.92ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 893.4MB). Free memory was 134.2MB in the beginning and 905.2MB in the end (delta: -771.0MB). Peak memory consumption was 122.2MB. Max. memory is 16.1GB. [2024-11-12 07:40:29,252 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:40:29,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.68ms. Allocated memory is still 169.9MB. Free memory was 134.0MB in the beginning and 126.3MB in the end (delta: 7.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 07:40:29,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.97ms. Allocated memory is still 169.9MB. Free memory was 126.3MB in the beginning and 122.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:40:29,253 INFO L158 Benchmark]: Boogie Preprocessor took 67.51ms. Allocated memory is still 169.9MB. Free memory was 122.1MB in the beginning and 117.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:40:29,253 INFO L158 Benchmark]: RCFGBuilder took 1048.03ms. Allocated memory is still 169.9MB. Free memory was 117.9MB in the beginning and 104.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 07:40:29,253 INFO L158 Benchmark]: TraceAbstraction took 33711.55ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 893.4MB). Free memory was 104.2MB in the beginning and 905.2MB in the end (delta: -801.0MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-11-12 07:40:29,254 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 1.1GB. Free memory is still 905.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:40:29,255 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 133.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.68ms. Allocated memory is still 169.9MB. Free memory was 134.0MB in the beginning and 126.3MB in the end (delta: 7.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.97ms. Allocated memory is still 169.9MB. Free memory was 126.3MB in the beginning and 122.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.51ms. Allocated memory is still 169.9MB. Free memory was 122.1MB in the beginning and 117.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1048.03ms. Allocated memory is still 169.9MB. Free memory was 117.9MB in the beginning and 104.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33711.55ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 893.4MB). Free memory was 104.2MB in the beginning and 905.2MB in the end (delta: -801.0MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 1.1GB. Free memory is still 905.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someUnaryDOUBLEoperation at line 51. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L55] unsigned char last_1_WrapperStruct00_var_1_11 = 1; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_11=1] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L114] EXPR WrapperStruct00.var_1_11 [L114] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L124] RET updateLastVariables() [L125] CALL updateVariables() [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L92] WrapperStruct00.var_1_7 = __VERIFIER_nondet_long() [L93] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L95] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L96] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L98] WrapperStruct00.var_1_9 = __VERIFIER_nondet_long() [L99] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_13 [L105] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_13 [L105] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L106] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_14 [L107] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_14 [L107] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] EXPR (WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] RET updateVariables() [L126] CALL step() [L59] unsigned char stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L60] COND FALSE !(! last_1_WrapperStruct00_var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L65] EXPR WrapperStruct00.var_1_7 [L65] signed long int stepLocal_2 = WrapperStruct00.var_1_7; [L66] EXPR WrapperStruct00.var_1_10 [L66] signed long int stepLocal_1 = WrapperStruct00.var_1_10; [L67] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911, stepLocal_2=1073741822] [L67] COND FALSE !(WrapperStruct00.var_1_8 <= stepLocal_2) [L74] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911] [L74] COND FALSE !(! WrapperStruct00.var_1_11) [L77] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911] [L77] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) [L77] EXPR WrapperStruct00.var_1_9 [L77] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911] [L77] EXPR WrapperStruct00.var_1_10 [L77] EXPR WrapperStruct00.var_1_7 [L77] WrapperStruct00.var_1_6 = ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7) [L79] WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=536870911] [L79] COND FALSE !(WrapperStruct00.var_1_4) [L82] EXPR WrapperStruct00.var_1_15 [L82] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_15 [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))) [L117] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))) [L117] EXPR WrapperStruct00.var_1_6 [L117] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) [L117] EXPR WrapperStruct00.var_1_9 [L117] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR WrapperStruct00.var_1_10 [L117] EXPR WrapperStruct00.var_1_7 [L117] EXPR (! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1) [L117] EXPR WrapperStruct00.var_1_8 [L117] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))) [L117] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15)) [L117] EXPR WrapperStruct00.var_1_12 [L117] EXPR WrapperStruct00.var_1_15 [L117] EXPR WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117-L118] return ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5))) : 1) : 1) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_6 == ((signed long int) (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8))) : (WrapperStruct00.var_1_6 == ((signed long int) ((((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) + WrapperStruct00.var_1_10) + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_10 >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned char) (! WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_1 || (! WrapperStruct00.var_1_5))))) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_12 == ((double) (((((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) < ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))))))) ? ((((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))) + WrapperStruct00.var_1_15)) : ((((((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) < 0 ) ? -((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16))) : ((((3.5) < (WrapperStruct00.var_1_16)) ? (3.5) : (WrapperStruct00.var_1_16)))))))))) : (WrapperStruct00.var_1_12 == ((double) WrapperStruct00.var_1_15))) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.5s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5658 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5654 mSDsluCounter, 16480 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12356 mSDsCounter, 503 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10916 IncrementalHoareTripleChecker+Invalid, 11419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 503 mSolverCounterUnsat, 4124 mSDtfsCounter, 10916 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1238 GetRequests, 1064 SyntacticMatches, 2 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=11, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 1912 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 3056 NumberOfCodeBlocks, 3056 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3033 ConstructedInterpolants, 0 QuantifiedInterpolants, 9971 SizeOfPredicates, 3 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 10452/10560 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 07:40:29,289 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_variablewrapping_wrapper-s_file-3.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 16590e9bc433910605f5e4d8182c46930e3c9f2a76ed7e606268a246ee561bc1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:40:31,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:40:31,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:40:31,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:40:31,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:40:31,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:40:31,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:40:31,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:40:31,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:40:31,712 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:40:31,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:40:31,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:40:31,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:40:31,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:40:31,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:40:31,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:40:31,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:40:31,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:40:31,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:40:31,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:40:31,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:40:31,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:40:31,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:40:31,722 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:40:31,722 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:40:31,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:40:31,722 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:40:31,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:40:31,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:40:31,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:40:31,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:40:31,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:40:31,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:40:31,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:40:31,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:40:31,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:40:31,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:40:31,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:40:31,727 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:40:31,727 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:40:31,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:40:31,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:40:31,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:40:31,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:40:31,728 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 -> 16590e9bc433910605f5e4d8182c46930e3c9f2a76ed7e606268a246ee561bc1 [2024-11-12 07:40:32,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:40:32,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:40:32,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:40:32,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:40:32,126 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:40:32,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i [2024-11-12 07:40:33,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:40:33,915 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:40:33,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-3.i [2024-11-12 07:40:33,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71ab7bcc/5a8e766278aa43bdbedd465020444517/FLAG1eb3be375 [2024-11-12 07:40:33,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71ab7bcc/5a8e766278aa43bdbedd465020444517 [2024-11-12 07:40:33,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:40:33,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:40:33,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:40:33,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:40:33,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:40:33,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:40:33" (1/1) ... [2024-11-12 07:40:33,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a826606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:33, skipping insertion in model container [2024-11-12 07:40:33,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:40:33" (1/1) ... [2024-11-12 07:40:33,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:40:34,183 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_variablewrapping_wrapper-s_file-3.i[915,928] [2024-11-12 07:40:34,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:40:34,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:40:34,292 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_variablewrapping_wrapper-s_file-3.i[915,928] [2024-11-12 07:40:34,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:40:34,374 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:40:34,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34 WrapperNode [2024-11-12 07:40:34,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:40:34,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:40:34,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:40:34,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:40:34,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,467 INFO L138 Inliner]: procedures = 34, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 622 [2024-11-12 07:40:34,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:40:34,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:40:34,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:40:34,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:40:34,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,530 INFO L175 MemorySlicer]: Split 152 memory accesses to 2 slices as follows [2, 150]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-12 07:40:34,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:40:34,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:40:34,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:40:34,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:40:34,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (1/1) ... [2024-11-12 07:40:34,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:40:34,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:40:34,617 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 07:40:34,625 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 07:40:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:40:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:40:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:40:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-12 07:40:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-12 07:40:34,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:40:34,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:40:34,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:40:34,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:40:34,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:40:34,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:40:34,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:40:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:40:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-12 07:40:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-12 07:40:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:40:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:40:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:40:34,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:40:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:40:34,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:40:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:40:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:40:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:40:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:40:34,811 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:40:34,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:40:36,705 INFO L? ?]: Removed 192 outVars from TransFormulas that were not future-live. [2024-11-12 07:40:36,706 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:40:36,724 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:40:36,725 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:40:36,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:40:36 BoogieIcfgContainer [2024-11-12 07:40:36,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:40:36,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:40:36,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:40:36,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:40:36,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:40:33" (1/3) ... [2024-11-12 07:40:36,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a0f235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:40:36, skipping insertion in model container [2024-11-12 07:40:36,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:34" (2/3) ... [2024-11-12 07:40:36,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a0f235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:40:36, skipping insertion in model container [2024-11-12 07:40:36,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:40:36" (3/3) ... [2024-11-12 07:40:36,733 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-3.i [2024-11-12 07:40:36,750 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:40:36,750 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:40:36,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:40:36,814 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;@30edeb9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:40:36,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:40:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:40:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:40:36,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:36,837 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:36,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:36,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash -962361363, now seen corresponding path program 1 times [2024-11-12 07:40:36,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:36,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256999556] [2024-11-12 07:40:36,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:36,854 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 07:40:36,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:36,856 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 07:40:36,857 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 07:40:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:37,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:40:37,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-12 07:40:37,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:37,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:37,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256999556] [2024-11-12 07:40:37,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256999556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:37,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:37,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:40:37,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167682978] [2024-11-12 07:40:37,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:37,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:40:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:37,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:40:37,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:40:37,324 INFO L87 Difference]: Start difference. First operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:40:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:37,368 INFO L93 Difference]: Finished difference Result 291 states and 454 transitions. [2024-11-12 07:40:37,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:40:37,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-12 07:40:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:37,380 INFO L225 Difference]: With dead ends: 291 [2024-11-12 07:40:37,380 INFO L226 Difference]: Without dead ends: 145 [2024-11-12 07:40:37,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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 07:40:37,388 INFO L435 NwaCegarLoop]: 215 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, 215 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 07:40:37,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-12 07:40:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-12 07:40:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:40:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2024-11-12 07:40:37,433 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 133 [2024-11-12 07:40:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:37,433 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2024-11-12 07:40:37,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:40:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2024-11-12 07:40:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:40:37,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:37,439 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:37,451 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 07:40:37,640 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 07:40:37,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:37,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:37,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1607444309, now seen corresponding path program 1 times [2024-11-12 07:40:37,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:37,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179743781] [2024-11-12 07:40:37,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:37,643 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 07:40:37,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:37,645 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 07:40:37,646 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 07:40:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:37,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:40:38,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-12 07:40:38,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:38,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:38,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179743781] [2024-11-12 07:40:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179743781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:38,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:38,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:40:38,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962297372] [2024-11-12 07:40:38,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:38,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:40:38,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:38,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:40:38,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:40:38,059 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:40:38,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:38,169 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2024-11-12 07:40:38,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:40:38,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-12 07:40:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:38,172 INFO L225 Difference]: With dead ends: 289 [2024-11-12 07:40:38,172 INFO L226 Difference]: Without dead ends: 147 [2024-11-12 07:40:38,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:40:38,177 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:38,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:40:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-12 07:40:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-12 07:40:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:40:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-11-12 07:40:38,200 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2024-11-12 07:40:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:38,203 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-11-12 07:40:38,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 07:40:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-11-12 07:40:38,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:40:38,210 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:38,210 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:38,222 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 07:40:38,410 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 07:40:38,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:38,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1658163689, now seen corresponding path program 1 times [2024-11-12 07:40:38,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:38,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524226252] [2024-11-12 07:40:38,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:38,415 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 07:40:38,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:38,418 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 07:40:38,420 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 07:40:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:38,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:40:38,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:38,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:38,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524226252] [2024-11-12 07:40:38,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524226252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:38,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:38,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:40:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304482987] [2024-11-12 07:40:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:38,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:40:38,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:38,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:40:38,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:40:38,769 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:38,817 INFO L93 Difference]: Finished difference Result 293 states and 434 transitions. [2024-11-12 07:40:38,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:40:38,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-12 07:40:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:38,822 INFO L225 Difference]: With dead ends: 293 [2024-11-12 07:40:38,822 INFO L226 Difference]: Without dead ends: 149 [2024-11-12 07:40:38,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:40:38,826 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:38,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-12 07:40:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-12 07:40:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 131 states have internal predecessors, (187), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:40:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2024-11-12 07:40:38,860 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 133 [2024-11-12 07:40:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:38,867 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2024-11-12 07:40:38,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2024-11-12 07:40:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:40:38,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:38,870 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:38,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 07:40:39,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:40:39,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:39,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash 565461865, now seen corresponding path program 1 times [2024-11-12 07:40:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250660811] [2024-11-12 07:40:39,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:39,073 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 07:40:39,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:39,077 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:40:39,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 07:40:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:39,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 07:40:39,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:39,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:39,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250660811] [2024-11-12 07:40:39,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250660811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:39,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:39,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:40:39,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049473313] [2024-11-12 07:40:39,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:39,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:40:39,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:39,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:40:39,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:40:39,429 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:39,480 INFO L93 Difference]: Finished difference Result 372 states and 550 transitions. [2024-11-12 07:40:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:40:39,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-12 07:40:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:39,483 INFO L225 Difference]: With dead ends: 372 [2024-11-12 07:40:39,483 INFO L226 Difference]: Without dead ends: 226 [2024-11-12 07:40:39,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 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 07:40:39,485 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 114 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:39,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 412 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-12 07:40:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 181. [2024-11-12 07:40:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 163 states have (on average 1.4478527607361964) internal successors, (236), 163 states have internal predecessors, (236), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 07:40:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 268 transitions. [2024-11-12 07:40:39,500 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 268 transitions. Word has length 135 [2024-11-12 07:40:39,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:39,502 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 268 transitions. [2024-11-12 07:40:39,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 268 transitions. [2024-11-12 07:40:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:40:39,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:39,504 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:39,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 07:40:39,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:40:39,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:39,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash -612419662, now seen corresponding path program 1 times [2024-11-12 07:40:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:39,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255705532] [2024-11-12 07:40:39,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:39,708 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 07:40:39,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:39,711 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:40:39,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:40:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:40,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-12 07:40:40,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:40,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:40:40,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-12 07:40:40,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:40,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 31 [2024-11-12 07:40:41,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:41,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 31 [2024-11-12 07:40:41,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:41,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 31 [2024-11-12 07:40:41,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:41,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 51 [2024-11-12 07:40:44,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:44,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 57 [2024-11-12 07:40:44,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:44,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 57 [2024-11-12 07:40:45,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:45,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 66 [2024-11-12 07:40:45,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:45,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 118 treesize of output 97 [2024-11-12 07:40:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 304 proven. 96 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-12 07:40:50,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:40:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:50,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:50,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255705532] [2024-11-12 07:40:50,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255705532] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:40:50,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:40:50,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [26] total 28 [2024-11-12 07:40:50,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841896546] [2024-11-12 07:40:50,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:50,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:40:50,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:50,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:40:50,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=635, Unknown=2, NotChecked=0, Total=756 [2024-11-12 07:40:50,331 INFO L87 Difference]: Start difference. First operand 181 states and 268 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:55,259 INFO L93 Difference]: Finished difference Result 471 states and 696 transitions. [2024-11-12 07:40:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:55,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-12 07:40:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:55,262 INFO L225 Difference]: With dead ends: 471 [2024-11-12 07:40:55,262 INFO L226 Difference]: Without dead ends: 293 [2024-11-12 07:40:55,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=131, Invalid=797, Unknown=2, NotChecked=0, Total=930 [2024-11-12 07:40:55,264 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 115 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:55,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 772 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-12 07:40:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-12 07:40:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2024-11-12 07:40:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 267 states have (on average 1.453183520599251) internal successors, (388), 268 states have internal predecessors, (388), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:40:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 428 transitions. [2024-11-12 07:40:55,280 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 428 transitions. Word has length 135 [2024-11-12 07:40:55,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:55,281 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 428 transitions. [2024-11-12 07:40:55,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 428 transitions. [2024-11-12 07:40:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:40:55,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:55,283 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:55,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 07:40:55,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:40:55,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:55,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -262788130, now seen corresponding path program 1 times [2024-11-12 07:40:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:55,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514908922] [2024-11-12 07:40:55,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:55,486 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 07:40:55,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:55,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:40:55,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 07:40:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:55,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:40:55,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:55,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:55,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514908922] [2024-11-12 07:40:55,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514908922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:55,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:55,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734079293] [2024-11-12 07:40:55,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:55,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:55,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:55,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:55,789 INFO L87 Difference]: Start difference. First operand 290 states and 428 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:55,832 INFO L93 Difference]: Finished difference Result 583 states and 861 transitions. [2024-11-12 07:40:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:55,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-12 07:40:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:55,837 INFO L225 Difference]: With dead ends: 583 [2024-11-12 07:40:55,837 INFO L226 Difference]: Without dead ends: 296 [2024-11-12 07:40:55,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:55,840 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:55,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 833 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-12 07:40:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-11-12 07:40:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 269 states have (on average 1.449814126394052) internal successors, (390), 270 states have internal predecessors, (390), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:40:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 430 transitions. [2024-11-12 07:40:55,868 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 430 transitions. Word has length 136 [2024-11-12 07:40:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:55,869 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 430 transitions. [2024-11-12 07:40:55,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 430 transitions. [2024-11-12 07:40:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 07:40:55,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:55,871 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:55,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-12 07:40:56,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:40:56,077 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:56,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash 130892061, now seen corresponding path program 1 times [2024-11-12 07:40:56,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:56,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678517965] [2024-11-12 07:40:56,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:56,078 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 07:40:56,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:56,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:40:56,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 07:40:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:56,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:40:56,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:40:56,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:56,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678517965] [2024-11-12 07:40:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678517965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:56,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:56,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:56,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294352694] [2024-11-12 07:40:56,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:56,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:56,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:56,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:56,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:56,394 INFO L87 Difference]: Start difference. First operand 292 states and 430 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:56,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:56,439 INFO L93 Difference]: Finished difference Result 587 states and 865 transitions. [2024-11-12 07:40:56,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:56,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-12 07:40:56,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:56,443 INFO L225 Difference]: With dead ends: 587 [2024-11-12 07:40:56,443 INFO L226 Difference]: Without dead ends: 298 [2024-11-12 07:40:56,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:56,445 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:56,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-12 07:40:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-12 07:40:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 275 states have (on average 1.44) internal successors, (396), 276 states have internal predecessors, (396), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:40:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 436 transitions. [2024-11-12 07:40:56,461 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 436 transitions. Word has length 137 [2024-11-12 07:40:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:56,462 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 436 transitions. [2024-11-12 07:40:56,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 07:40:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 436 transitions. [2024-11-12 07:40:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 07:40:56,464 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:56,466 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:40:56,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 07:40:56,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:40:56,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:56,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1320109804, now seen corresponding path program 1 times [2024-11-12 07:40:56,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:56,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884554088] [2024-11-12 07:40:56,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:56,672 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 07:40:56,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:56,673 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:40:56,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 07:40:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:57,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 07:40:57,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:57,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:40:57,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-12 07:40:57,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34