./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-22.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-22.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 e82610752a88d395729d794c88c73268443026b48dc2e1bfb9e59d87e1051314 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:38:55,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:38:55,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:38:55,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:38:55,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:38:55,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:38:55,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:38:55,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:38:55,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:38:55,590 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:38:55,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:38:55,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:38:55,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:38:55,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:38:55,592 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:38:55,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:38:55,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:38:55,593 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:38:55,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:38:55,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:38:55,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:38:55,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:38:55,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:38:55,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:38:55,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:38:55,598 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:38:55,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:38:55,598 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:38:55,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:38:55,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:38:55,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:38:55,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:38:55,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:38:55,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:38:55,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:38:55,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:38:55,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:38:55,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:38:55,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:38:55,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:38:55,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:38:55,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:38:55,604 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 -> e82610752a88d395729d794c88c73268443026b48dc2e1bfb9e59d87e1051314 [2024-11-12 07:38:55,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:38:55,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:38:55,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:38:55,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:38:55,848 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:38:55,849 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-22.i [2024-11-12 07:38:57,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:38:57,253 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:38:57,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-22.i [2024-11-12 07:38:57,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8bccf7fd/d616185e7bcd4772afd0ae9a9a2ebe22/FLAGa190d15a9 [2024-11-12 07:38:57,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8bccf7fd/d616185e7bcd4772afd0ae9a9a2ebe22 [2024-11-12 07:38:57,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:38:57,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:38:57,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:38:57,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:38:57,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:38:57,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:57,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2996bfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57, skipping insertion in model container [2024-11-12 07:38:57,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:57,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:38:57,807 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-22.i[916,929] [2024-11-12 07:38:57,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:38:57,862 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:38:57,871 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-22.i[916,929] [2024-11-12 07:38:57,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:38:57,916 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:38:57,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57 WrapperNode [2024-11-12 07:38:57,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:38:57,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:38:57,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:38:57,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:38:57,924 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:38:57" (1/1) ... [2024-11-12 07:38:57,934 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:38:57" (1/1) ... [2024-11-12 07:38:57,961 INFO L138 Inliner]: procedures = 30, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2024-11-12 07:38:57,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:38:57,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:38:57,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:38:57,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:38:57,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:57,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:57,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:57,999 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:38:58,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:58,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:58,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:58,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:58,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:58,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:58,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:38:58,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:38:58,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:38:58,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:38:58,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57" (1/1) ... [2024-11-12 07:38:58,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:38:58,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:38:58,078 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:38:58,085 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:38:58,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:38:58,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:38:58,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:38:58,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:38:58,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:38:58,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:38:58,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:38:58,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:38:58,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:38:58,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:38:58,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:38:58,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:38:58,215 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:38:58,217 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:38:58,667 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-12 07:38:58,667 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:38:58,684 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:38:58,684 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:38:58,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:38:58 BoogieIcfgContainer [2024-11-12 07:38:58,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:38:58,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:38:58,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:38:58,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:38:58,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:38:57" (1/3) ... [2024-11-12 07:38:58,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca2afca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:38:58, skipping insertion in model container [2024-11-12 07:38:58,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:38:57" (2/3) ... [2024-11-12 07:38:58,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca2afca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:38:58, skipping insertion in model container [2024-11-12 07:38:58,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:38:58" (3/3) ... [2024-11-12 07:38:58,694 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-22.i [2024-11-12 07:38:58,708 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:38:58,708 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:38:58,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:38:58,763 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;@760632e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:38:58,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:38:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:38:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 07:38:58,775 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:58,775 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:58,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:58,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:58,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1659460873, now seen corresponding path program 1 times [2024-11-12 07:38:58,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:58,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134319837] [2024-11-12 07:38:58,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:38:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:59,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:38:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:38:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:38:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:59,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:38:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:59,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:38:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:59,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:38:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:59,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:38:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:59,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:38:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:38:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:38:59,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:38:59,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134319837] [2024-11-12 07:38:59,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134319837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:38:59,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:38:59,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:38:59,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816532576] [2024-11-12 07:38:59,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:38:59,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:38:59,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:38:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:38:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:38:59,242 INFO L87 Difference]: Start difference. First operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:38:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:38:59,299 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2024-11-12 07:38:59,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:38:59,303 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2024-11-12 07:38:59,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:38:59,310 INFO L225 Difference]: With dead ends: 203 [2024-11-12 07:38:59,310 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 07:38:59,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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:38:59,319 INFO L435 NwaCegarLoop]: 146 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, 146 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:38:59,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:38:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 07:38:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-12 07:38:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:38:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-12 07:38:59,365 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 90 [2024-11-12 07:38:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:38:59,367 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-12 07:38:59,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:38:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-12 07:38:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 07:38:59,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:38:59,370 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:59,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:38:59,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:38:59,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:38:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 328924025, now seen corresponding path program 1 times [2024-11-12 07:38:59,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:38:59,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817489600] [2024-11-12 07:38:59,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:38:59,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:38:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:00,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:00,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817489600] [2024-11-12 07:39:00,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817489600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:00,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:00,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:39:00,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44337195] [2024-11-12 07:39:00,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:00,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:39:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:00,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:39:00,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:39:00,458 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:01,355 INFO L93 Difference]: Finished difference Result 747 states and 1086 transitions. [2024-11-12 07:39:01,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:39:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-11-12 07:39:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:01,363 INFO L225 Difference]: With dead ends: 747 [2024-11-12 07:39:01,363 INFO L226 Difference]: Without dead ends: 649 [2024-11-12 07:39:01,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:39:01,365 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 1045 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:01,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 891 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:39:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-12 07:39:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 481. [2024-11-12 07:39:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 430 states have (on average 1.427906976744186) internal successors, (614), 430 states have internal predecessors, (614), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 07:39:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 704 transitions. [2024-11-12 07:39:01,423 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 704 transitions. Word has length 90 [2024-11-12 07:39:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:01,426 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 704 transitions. [2024-11-12 07:39:01,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 704 transitions. [2024-11-12 07:39:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 07:39:01,428 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:01,429 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:39:01,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:01,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash 915730039, now seen corresponding path program 1 times [2024-11-12 07:39:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:01,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232294350] [2024-11-12 07:39:01,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:01,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:02,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:02,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:02,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:02,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:02,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:02,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:02,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:02,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232294350] [2024-11-12 07:39:02,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232294350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:02,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:02,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:39:02,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006979187] [2024-11-12 07:39:02,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:02,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:39:02,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:02,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:39:02,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:39:02,123 INFO L87 Difference]: Start difference. First operand 481 states and 704 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:02,898 INFO L93 Difference]: Finished difference Result 1335 states and 1946 transitions. [2024-11-12 07:39:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:39:02,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-11-12 07:39:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:02,906 INFO L225 Difference]: With dead ends: 1335 [2024-11-12 07:39:02,906 INFO L226 Difference]: Without dead ends: 857 [2024-11-12 07:39:02,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:39:02,908 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 340 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:02,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 621 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:39:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-12 07:39:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 662. [2024-11-12 07:39:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 591 states have (on average 1.4213197969543148) internal successors, (840), 591 states have internal predecessors, (840), 63 states have call successors, (63), 7 states have call predecessors, (63), 7 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-12 07:39:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 966 transitions. [2024-11-12 07:39:02,954 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 966 transitions. Word has length 90 [2024-11-12 07:39:02,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:02,956 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 966 transitions. [2024-11-12 07:39:02,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 966 transitions. [2024-11-12 07:39:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-12 07:39:02,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:02,962 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:39:02,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:02,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1540153901, now seen corresponding path program 1 times [2024-11-12 07:39:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:02,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854038836] [2024-11-12 07:39:02,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:02,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:03,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:03,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854038836] [2024-11-12 07:39:03,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854038836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:03,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:03,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:39:03,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450101540] [2024-11-12 07:39:03,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:03,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:39:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:03,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:39:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:39:03,371 INFO L87 Difference]: Start difference. First operand 662 states and 966 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:03,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:03,675 INFO L93 Difference]: Finished difference Result 1890 states and 2754 transitions. [2024-11-12 07:39:03,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:39:03,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-12 07:39:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:03,681 INFO L225 Difference]: With dead ends: 1890 [2024-11-12 07:39:03,682 INFO L226 Difference]: Without dead ends: 1231 [2024-11-12 07:39:03,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:39:03,685 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 430 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:03,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 517 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:39:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-12 07:39:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 857. [2024-11-12 07:39:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 766 states have (on average 1.4203655352480418) internal successors, (1088), 766 states have internal predecessors, (1088), 81 states have call successors, (81), 9 states have call predecessors, (81), 9 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-12 07:39:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1250 transitions. [2024-11-12 07:39:03,741 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1250 transitions. Word has length 91 [2024-11-12 07:39:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:03,742 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1250 transitions. [2024-11-12 07:39:03,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1250 transitions. [2024-11-12 07:39:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:39:03,743 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:03,743 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:39:03,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:03,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1109130490, now seen corresponding path program 1 times [2024-11-12 07:39:03,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:03,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312582727] [2024-11-12 07:39:03,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:03,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:03,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:03,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312582727] [2024-11-12 07:39:03,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312582727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:03,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:03,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:03,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068533775] [2024-11-12 07:39:03,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:03,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:03,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:03,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:03,819 INFO L87 Difference]: Start difference. First operand 857 states and 1250 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:03,883 INFO L93 Difference]: Finished difference Result 1494 states and 2177 transitions. [2024-11-12 07:39:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:03,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-12 07:39:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:03,887 INFO L225 Difference]: With dead ends: 1494 [2024-11-12 07:39:03,887 INFO L226 Difference]: Without dead ends: 640 [2024-11-12 07:39:03,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:03,889 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:03,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-12 07:39:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 627. [2024-11-12 07:39:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 556 states have (on average 1.3992805755395683) internal successors, (778), 556 states have internal predecessors, (778), 63 states have call successors, (63), 7 states have call predecessors, (63), 7 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-12 07:39:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 904 transitions. [2024-11-12 07:39:03,912 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 904 transitions. Word has length 92 [2024-11-12 07:39:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:03,912 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 904 transitions. [2024-11-12 07:39:03,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 904 transitions. [2024-11-12 07:39:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 07:39:03,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:03,914 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:39:03,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:03,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:03,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1007745668, now seen corresponding path program 1 times [2024-11-12 07:39:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:03,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362513817] [2024-11-12 07:39:03,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:03,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:04,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:04,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:04,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:04,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:04,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:04,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:04,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:39:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:04,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362513817] [2024-11-12 07:39:04,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362513817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:04,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729904277] [2024-11-12 07:39:04,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:04,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:39:04,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:39:04,560 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:39:04,561 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:39:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:04,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 07:39:04,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:04,770 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 55 treesize of output 54 [2024-11-12 07:39:04,976 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 116 treesize of output 94 [2024-11-12 07:39:05,132 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 13 treesize of output 11 [2024-11-12 07:39:05,162 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 23 treesize of output 24 [2024-11-12 07:39:05,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:05,232 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 40 treesize of output 27 [2024-11-12 07:39:05,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:05,246 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 40 treesize of output 27 [2024-11-12 07:39:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:39:05,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:05,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729904277] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:05,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:39:05,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 9] total 20 [2024-11-12 07:39:05,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654791374] [2024-11-12 07:39:05,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:05,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:39:05,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:05,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:39:05,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:39:05,743 INFO L87 Difference]: Start difference. First operand 627 states and 904 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:06,106 INFO L93 Difference]: Finished difference Result 1203 states and 1739 transitions. [2024-11-12 07:39:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:39:06,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-12 07:39:06,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:06,110 INFO L225 Difference]: With dead ends: 1203 [2024-11-12 07:39:06,110 INFO L226 Difference]: Without dead ends: 730 [2024-11-12 07:39:06,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:39:06,112 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 120 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:06,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 637 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:39:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-11-12 07:39:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 724. [2024-11-12 07:39:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 643 states have (on average 1.3996889580093312) internal successors, (900), 643 states have internal predecessors, (900), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-12 07:39:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1044 transitions. [2024-11-12 07:39:06,147 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1044 transitions. Word has length 95 [2024-11-12 07:39:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:06,147 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1044 transitions. [2024-11-12 07:39:06,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1044 transitions. [2024-11-12 07:39:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:39:06,148 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:06,149 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,162 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:39:06,349 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,SelfDestructingSolverStorable5 [2024-11-12 07:39:06,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:06,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash -86241146, now seen corresponding path program 1 times [2024-11-12 07:39:06,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:06,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426997832] [2024-11-12 07:39:06,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:06,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:06,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:06,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426997832] [2024-11-12 07:39:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426997832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:06,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:39:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461962442] [2024-11-12 07:39:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:06,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:39:06,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:06,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:39:06,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:39:06,959 INFO L87 Difference]: Start difference. First operand 724 states and 1044 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:07,370 INFO L93 Difference]: Finished difference Result 1363 states and 1958 transitions. [2024-11-12 07:39:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:39:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-12 07:39:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:07,373 INFO L225 Difference]: With dead ends: 1363 [2024-11-12 07:39:07,373 INFO L226 Difference]: Without dead ends: 688 [2024-11-12 07:39:07,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:39:07,375 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 599 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:07,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 560 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:39:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-12 07:39:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 525. [2024-11-12 07:39:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 464 states have (on average 1.3922413793103448) internal successors, (646), 464 states have internal predecessors, (646), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:39:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 754 transitions. [2024-11-12 07:39:07,396 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 754 transitions. Word has length 96 [2024-11-12 07:39:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:07,397 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 754 transitions. [2024-11-12 07:39:07,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 754 transitions. [2024-11-12 07:39:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:39:07,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:07,398 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:39:07,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:07,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1520928257, now seen corresponding path program 1 times [2024-11-12 07:39:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:07,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656497794] [2024-11-12 07:39:07,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:07,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:08,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:08,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:08,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:08,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:08,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:08,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:08,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:08,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:08,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:08,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:08,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656497794] [2024-11-12 07:39:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656497794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:39:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987441025] [2024-11-12 07:39:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:39:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:39:08,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:39:08,186 INFO L87 Difference]: Start difference. First operand 525 states and 754 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:08,736 INFO L93 Difference]: Finished difference Result 1068 states and 1529 transitions. [2024-11-12 07:39:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:39:08,737 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-12 07:39:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:08,740 INFO L225 Difference]: With dead ends: 1068 [2024-11-12 07:39:08,740 INFO L226 Difference]: Without dead ends: 687 [2024-11-12 07:39:08,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:39:08,744 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 367 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:08,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 829 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:39:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-12 07:39:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 552. [2024-11-12 07:39:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 491 states have (on average 1.3890020366598779) internal successors, (682), 491 states have internal predecessors, (682), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:39:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 790 transitions. [2024-11-12 07:39:08,776 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 790 transitions. Word has length 97 [2024-11-12 07:39:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:08,778 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 790 transitions. [2024-11-12 07:39:08,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 790 transitions. [2024-11-12 07:39:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:39:08,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:08,779 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:39:08,780 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:08,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -628268982, now seen corresponding path program 1 times [2024-11-12 07:39:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179728817] [2024-11-12 07:39:08,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:09,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:09,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:09,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:09,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:09,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:09,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:09,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:09,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:09,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:09,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179728817] [2024-11-12 07:39:09,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179728817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:09,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:09,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:39:09,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377666523] [2024-11-12 07:39:09,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:09,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:39:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:09,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:39:09,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:39:09,469 INFO L87 Difference]: Start difference. First operand 552 states and 790 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:09,928 INFO L93 Difference]: Finished difference Result 1072 states and 1531 transitions. [2024-11-12 07:39:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:39:09,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-12 07:39:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:09,931 INFO L225 Difference]: With dead ends: 1072 [2024-11-12 07:39:09,931 INFO L226 Difference]: Without dead ends: 683 [2024-11-12 07:39:09,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:39:09,932 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 411 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:09,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 833 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:39:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-12 07:39:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 544. [2024-11-12 07:39:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 483 states have (on average 1.3830227743271222) internal successors, (668), 483 states have internal predecessors, (668), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:39:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 776 transitions. [2024-11-12 07:39:09,954 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 776 transitions. Word has length 97 [2024-11-12 07:39:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:09,954 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 776 transitions. [2024-11-12 07:39:09,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 776 transitions. [2024-11-12 07:39:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:39:09,955 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:09,955 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:39:09,956 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:09,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1378931136, now seen corresponding path program 1 times [2024-11-12 07:39:09,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:09,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838976869] [2024-11-12 07:39:09,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:09,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:10,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:10,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:10,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:10,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:10,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:10,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838976869] [2024-11-12 07:39:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838976869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:10,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:10,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:39:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885717778] [2024-11-12 07:39:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:10,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:39:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:10,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:39:10,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:39:10,257 INFO L87 Difference]: Start difference. First operand 544 states and 776 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:10,722 INFO L93 Difference]: Finished difference Result 1395 states and 1990 transitions. [2024-11-12 07:39:10,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:39:10,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-12 07:39:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:10,726 INFO L225 Difference]: With dead ends: 1395 [2024-11-12 07:39:10,727 INFO L226 Difference]: Without dead ends: 900 [2024-11-12 07:39:10,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:39:10,729 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 231 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:10,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 541 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:39:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-12 07:39:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 559. [2024-11-12 07:39:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 498 states have (on average 1.3775100401606426) internal successors, (686), 498 states have internal predecessors, (686), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:39:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 794 transitions. [2024-11-12 07:39:10,753 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 794 transitions. Word has length 97 [2024-11-12 07:39:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:10,753 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 794 transitions. [2024-11-12 07:39:10,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 794 transitions. [2024-11-12 07:39:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:39:10,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:10,755 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:39:10,755 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:10,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1316891522, now seen corresponding path program 1 times [2024-11-12 07:39:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:10,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773571073] [2024-11-12 07:39:10,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:11,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:11,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:11,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:11,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:11,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:11,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:11,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773571073] [2024-11-12 07:39:11,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773571073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:11,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:11,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 07:39:11,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294200949] [2024-11-12 07:39:11,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:11,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 07:39:11,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:11,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 07:39:11,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:39:11,922 INFO L87 Difference]: Start difference. First operand 559 states and 794 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:13,680 INFO L93 Difference]: Finished difference Result 1382 states and 1966 transitions. [2024-11-12 07:39:13,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 07:39:13,681 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-11-12 07:39:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:13,685 INFO L225 Difference]: With dead ends: 1382 [2024-11-12 07:39:13,685 INFO L226 Difference]: Without dead ends: 1190 [2024-11-12 07:39:13,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2024-11-12 07:39:13,686 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 974 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:13,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 999 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 07:39:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-12 07:39:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 662. [2024-11-12 07:39:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 591 states have (on average 1.3824027072758038) internal successors, (817), 591 states have internal predecessors, (817), 63 states have call successors, (63), 7 states have call predecessors, (63), 7 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-12 07:39:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 943 transitions. [2024-11-12 07:39:13,717 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 943 transitions. Word has length 97 [2024-11-12 07:39:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:13,717 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 943 transitions. [2024-11-12 07:39:13,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 943 transitions. [2024-11-12 07:39:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:39:13,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:13,718 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:39:13,719 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:13,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash -730085508, now seen corresponding path program 1 times [2024-11-12 07:39:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:13,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522399321] [2024-11-12 07:39:13,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:14,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522399321] [2024-11-12 07:39:14,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522399321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:14,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:14,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:39:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091449913] [2024-11-12 07:39:14,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:14,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:39:14,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:14,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:39:14,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:39:14,189 INFO L87 Difference]: Start difference. First operand 662 states and 943 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:14,382 INFO L93 Difference]: Finished difference Result 1139 states and 1629 transitions. [2024-11-12 07:39:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:39:14,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-11-12 07:39:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:14,386 INFO L225 Difference]: With dead ends: 1139 [2024-11-12 07:39:14,386 INFO L226 Difference]: Without dead ends: 847 [2024-11-12 07:39:14,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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:39:14,388 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:14,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 441 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:39:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-12 07:39:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 662. [2024-11-12 07:39:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 591 states have (on average 1.3756345177664975) internal successors, (813), 591 states have internal predecessors, (813), 63 states have call successors, (63), 7 states have call predecessors, (63), 7 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-12 07:39:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 939 transitions. [2024-11-12 07:39:14,414 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 939 transitions. Word has length 97 [2024-11-12 07:39:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:14,415 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 939 transitions. [2024-11-12 07:39:14,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 939 transitions. [2024-11-12 07:39:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:39:14,415 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:14,416 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:39:14,416 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:14,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash -511230790, now seen corresponding path program 1 times [2024-11-12 07:39:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:14,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574607772] [2024-11-12 07:39:14,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:14,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:15,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:15,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574607772] [2024-11-12 07:39:15,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574607772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:15,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:15,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:39:15,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898854643] [2024-11-12 07:39:15,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:15,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:39:15,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:15,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:39:15,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:39:15,095 INFO L87 Difference]: Start difference. First operand 662 states and 939 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:15,870 INFO L93 Difference]: Finished difference Result 1313 states and 1860 transitions. [2024-11-12 07:39:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:39:15,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-11-12 07:39:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:15,873 INFO L225 Difference]: With dead ends: 1313 [2024-11-12 07:39:15,874 INFO L226 Difference]: Without dead ends: 717 [2024-11-12 07:39:15,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:39:15,876 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 228 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:15,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 658 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:39:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-12 07:39:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 570. [2024-11-12 07:39:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 509 states have (on average 1.3693516699410608) internal successors, (697), 509 states have internal predecessors, (697), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:39:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 805 transitions. [2024-11-12 07:39:15,899 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 805 transitions. Word has length 97 [2024-11-12 07:39:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:15,899 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 805 transitions. [2024-11-12 07:39:15,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 805 transitions. [2024-11-12 07:39:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:39:15,900 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:15,900 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:39:15,901 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:15,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:15,901 INFO L85 PathProgramCache]: Analyzing trace with hash -72641074, now seen corresponding path program 1 times [2024-11-12 07:39:15,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:15,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303687711] [2024-11-12 07:39:15,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:16,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:16,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303687711] [2024-11-12 07:39:16,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303687711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:16,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:16,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:16,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425552082] [2024-11-12 07:39:16,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:16,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:16,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:16,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:16,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:16,059 INFO L87 Difference]: Start difference. First operand 570 states and 805 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:16,074 INFO L93 Difference]: Finished difference Result 786 states and 1109 transitions. [2024-11-12 07:39:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:16,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-12 07:39:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:16,076 INFO L225 Difference]: With dead ends: 786 [2024-11-12 07:39:16,076 INFO L226 Difference]: Without dead ends: 278 [2024-11-12 07:39:16,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:16,077 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:16,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:16,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-12 07:39:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2024-11-12 07:39:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 237 states have (on average 1.3291139240506329) internal successors, (315), 237 states have internal predecessors, (315), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:39:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 369 transitions. [2024-11-12 07:39:16,089 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 369 transitions. Word has length 98 [2024-11-12 07:39:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:16,090 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 369 transitions. [2024-11-12 07:39:16,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 369 transitions. [2024-11-12 07:39:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:39:16,091 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:16,091 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:39:16,092 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:16,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1291021946, now seen corresponding path program 1 times [2024-11-12 07:39:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:16,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316553996] [2024-11-12 07:39:16,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:39:16,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:16,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316553996] [2024-11-12 07:39:16,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316553996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:16,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623838981] [2024-11-12 07:39:16,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:16,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:39:16,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:39:16,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:39:16,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 07:39:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:16,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-12 07:39:17,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:17,029 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 55 treesize of output 54 [2024-11-12 07:39:17,214 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 119 treesize of output 97 [2024-11-12 07:39:17,352 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 19 treesize of output 1 [2024-11-12 07:39:17,602 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 36 treesize of output 31 [2024-11-12 07:39:17,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:17,685 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 49 treesize of output 34 [2024-11-12 07:39:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 07:39:17,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:17,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623838981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:17,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:39:17,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 25 [2024-11-12 07:39:17,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46617691] [2024-11-12 07:39:17,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:17,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 07:39:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:17,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 07:39:17,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-12 07:39:17,870 INFO L87 Difference]: Start difference. First operand 268 states and 369 transitions. Second operand has 17 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-12 07:39:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:21,147 INFO L93 Difference]: Finished difference Result 561 states and 771 transitions. [2024-11-12 07:39:21,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 07:39:21,148 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 99 [2024-11-12 07:39:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:21,149 INFO L225 Difference]: With dead ends: 561 [2024-11-12 07:39:21,150 INFO L226 Difference]: Without dead ends: 362 [2024-11-12 07:39:21,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=354, Invalid=1626, Unknown=0, NotChecked=0, Total=1980 [2024-11-12 07:39:21,151 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 433 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:21,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 634 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 07:39:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-12 07:39:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 278. [2024-11-12 07:39:21,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 245 states have (on average 1.3183673469387756) internal successors, (323), 245 states have internal predecessors, (323), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:39:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 377 transitions. [2024-11-12 07:39:21,169 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 377 transitions. Word has length 99 [2024-11-12 07:39:21,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:21,169 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 377 transitions. [2024-11-12 07:39:21,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-12 07:39:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 377 transitions. [2024-11-12 07:39:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:39:21,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:21,170 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 07:39:21,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 07:39:21,371 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:21,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1509876664, now seen corresponding path program 1 times [2024-11-12 07:39:21,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:21,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628280285] [2024-11-12 07:39:21,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:21,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:22,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:22,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:22,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:22,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:22,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:39:22,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628280285] [2024-11-12 07:39:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628280285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282395127] [2024-11-12 07:39:22,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:22,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:39:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:39:22,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:39:22,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 07:39:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:22,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 07:39:22,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:22,295 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:39:22,314 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:39:22,332 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:39:22,353 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:39:22,382 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:39:22,390 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 27 treesize of output 15 [2024-11-12 07:39:22,403 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 21 treesize of output 9 [2024-11-12 07:39:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 18 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-12 07:39:22,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:39:22,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282395127] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:39:22,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 07:39:22,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-11-12 07:39:22,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083379256] [2024-11-12 07:39:22,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 07:39:22,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 07:39:22,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:22,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 07:39:22,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:39:22,630 INFO L87 Difference]: Start difference. First operand 278 states and 377 transitions. Second operand has 17 states, 14 states have (on average 9.0) internal successors, (126), 17 states have internal predecessors, (126), 8 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 5 states have call predecessors, (25), 8 states have call successors, (25) [2024-11-12 07:39:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:23,239 INFO L93 Difference]: Finished difference Result 577 states and 785 transitions. [2024-11-12 07:39:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 07:39:23,239 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.0) internal successors, (126), 17 states have internal predecessors, (126), 8 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 5 states have call predecessors, (25), 8 states have call successors, (25) Word has length 99 [2024-11-12 07:39:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:23,242 INFO L225 Difference]: With dead ends: 577 [2024-11-12 07:39:23,242 INFO L226 Difference]: Without dead ends: 374 [2024-11-12 07:39:23,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2024-11-12 07:39:23,244 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 590 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:23,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 418 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:39:23,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-12 07:39:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 288. [2024-11-12 07:39:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 252 states have (on average 1.2936507936507937) internal successors, (326), 252 states have internal predecessors, (326), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:39:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 380 transitions. [2024-11-12 07:39:23,265 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 380 transitions. Word has length 99 [2024-11-12 07:39:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:23,265 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 380 transitions. [2024-11-12 07:39:23,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.0) internal successors, (126), 17 states have internal predecessors, (126), 8 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 5 states have call predecessors, (25), 8 states have call successors, (25) [2024-11-12 07:39:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 380 transitions. [2024-11-12 07:39:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:39:23,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:23,266 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 07:39:23,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:39:23,467 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:23,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1684868203, now seen corresponding path program 1 times [2024-11-12 07:39:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:23,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235824043] [2024-11-12 07:39:23,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:23,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:23,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:23,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:23,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:23,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:23,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:23,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235824043] [2024-11-12 07:39:23,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235824043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:23,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:23,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:39:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296949190] [2024-11-12 07:39:23,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:23,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:39:23,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:23,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:39:23,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:39:23,908 INFO L87 Difference]: Start difference. First operand 288 states and 380 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:24,422 INFO L93 Difference]: Finished difference Result 621 states and 840 transitions. [2024-11-12 07:39:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:39:24,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-12 07:39:24,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:24,425 INFO L225 Difference]: With dead ends: 621 [2024-11-12 07:39:24,425 INFO L226 Difference]: Without dead ends: 519 [2024-11-12 07:39:24,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:39:24,426 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 517 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:24,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 610 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:39:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-12 07:39:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 386. [2024-11-12 07:39:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 339 states have (on average 1.3097345132743363) internal successors, (444), 339 states have internal predecessors, (444), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 07:39:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 516 transitions. [2024-11-12 07:39:24,450 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 516 transitions. Word has length 99 [2024-11-12 07:39:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:24,450 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 516 transitions. [2024-11-12 07:39:24,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 516 transitions. [2024-11-12 07:39:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:39:24,451 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:24,451 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:39:24,452 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:24,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:24,452 INFO L85 PathProgramCache]: Analyzing trace with hash -405004525, now seen corresponding path program 1 times [2024-11-12 07:39:24,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:24,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107542836] [2024-11-12 07:39:24,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:24,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:24,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:24,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:24,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:24,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:24,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:24,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:24,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:24,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:24,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:24,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107542836] [2024-11-12 07:39:24,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107542836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:24,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:24,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:39:24,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957347474] [2024-11-12 07:39:24,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:24,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:39:24,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:24,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:39:24,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:39:24,981 INFO L87 Difference]: Start difference. First operand 386 states and 516 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:25,197 INFO L93 Difference]: Finished difference Result 766 states and 1040 transitions. [2024-11-12 07:39:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:39:25,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2024-11-12 07:39:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:25,200 INFO L225 Difference]: With dead ends: 766 [2024-11-12 07:39:25,200 INFO L226 Difference]: Without dead ends: 472 [2024-11-12 07:39:25,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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:39:25,201 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 61 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:25,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 507 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:39:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-12 07:39:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 410. [2024-11-12 07:39:25,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 363 states have (on average 1.3057851239669422) internal successors, (474), 363 states have internal predecessors, (474), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 07:39:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 546 transitions. [2024-11-12 07:39:25,221 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 546 transitions. Word has length 99 [2024-11-12 07:39:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:25,222 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 546 transitions. [2024-11-12 07:39:25,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 546 transitions. [2024-11-12 07:39:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:39:25,223 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:25,223 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:39:25,223 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:25,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 487654750, now seen corresponding path program 1 times [2024-11-12 07:39:25,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:25,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804085142] [2024-11-12 07:39:25,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:25,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:25,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:25,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:25,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:25,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:25,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:25,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:25,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804085142] [2024-11-12 07:39:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804085142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:25,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:25,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:39:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563934599] [2024-11-12 07:39:25,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:25,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:39:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:25,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:39:25,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:39:25,776 INFO L87 Difference]: Start difference. First operand 410 states and 546 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:25,962 INFO L93 Difference]: Finished difference Result 696 states and 939 transitions. [2024-11-12 07:39:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:39:25,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2024-11-12 07:39:25,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:25,964 INFO L225 Difference]: With dead ends: 696 [2024-11-12 07:39:25,965 INFO L226 Difference]: Without dead ends: 472 [2024-11-12 07:39:25,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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:39:25,966 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 124 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:25,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 435 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:39:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-12 07:39:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 410. [2024-11-12 07:39:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 363 states have (on average 1.300275482093664) internal successors, (472), 363 states have internal predecessors, (472), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 07:39:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 544 transitions. [2024-11-12 07:39:25,990 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 544 transitions. Word has length 99 [2024-11-12 07:39:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:25,991 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 544 transitions. [2024-11-12 07:39:25,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 544 transitions. [2024-11-12 07:39:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:39:25,992 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:25,992 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:39:25,992 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:25,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 745820188, now seen corresponding path program 1 times [2024-11-12 07:39:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:25,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189011091] [2024-11-12 07:39:25,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:39:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:39:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:39:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:39:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:26,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:26,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189011091] [2024-11-12 07:39:26,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189011091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:26,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:26,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:39:26,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584073100] [2024-11-12 07:39:26,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:26,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:39:26,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:26,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:39:26,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:39:26,099 INFO L87 Difference]: Start difference. First operand 410 states and 544 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:26,133 INFO L93 Difference]: Finished difference Result 637 states and 854 transitions. [2024-11-12 07:39:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:39:26,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-12 07:39:26,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:26,135 INFO L225 Difference]: With dead ends: 637 [2024-11-12 07:39:26,135 INFO L226 Difference]: Without dead ends: 413 [2024-11-12 07:39:26,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:39:26,136 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:26,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-12 07:39:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2024-11-12 07:39:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 360 states have (on average 1.2972222222222223) internal successors, (467), 360 states have internal predecessors, (467), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 07:39:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 539 transitions. [2024-11-12 07:39:26,159 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 539 transitions. Word has length 99 [2024-11-12 07:39:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:26,159 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 539 transitions. [2024-11-12 07:39:26,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 539 transitions. [2024-11-12 07:39:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 07:39:26,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:26,160 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 07:39:26,161 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:26,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash -173005409, now seen corresponding path program 1 times [2024-11-12 07:39:26,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:26,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021907733] [2024-11-12 07:39:26,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:26,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:39:26,208 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:39:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:39:26,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:39:26,269 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:39:26,270 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:39:26,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 07:39:26,274 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:39:26,334 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:39:26,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:39:26 BoogieIcfgContainer [2024-11-12 07:39:26,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:39:26,336 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:39:26,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:39:26,336 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:39:26,337 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:38:58" (3/4) ... [2024-11-12 07:39:26,339 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:39:26,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:39:26,340 INFO L158 Benchmark]: Toolchain (without parser) took 28687.15ms. Allocated memory was 155.2MB in the beginning and 641.7MB in the end (delta: 486.5MB). Free memory was 82.7MB in the beginning and 390.3MB in the end (delta: -307.6MB). Peak memory consumption was 181.2MB. Max. memory is 16.1GB. [2024-11-12 07:39:26,341 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory was 106.8MB in the beginning and 106.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:39:26,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.07ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 66.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 07:39:26,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.62ms. Allocated memory is still 155.2MB. Free memory was 65.8MB in the beginning and 61.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:39:26,341 INFO L158 Benchmark]: Boogie Preprocessor took 82.65ms. Allocated memory was 155.2MB in the beginning and 195.0MB in the end (delta: 39.8MB). Free memory was 61.9MB in the beginning and 165.4MB in the end (delta: -103.5MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-12 07:39:26,341 INFO L158 Benchmark]: RCFGBuilder took 640.06ms. Allocated memory is still 195.0MB. Free memory was 165.4MB in the beginning and 131.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-12 07:39:26,341 INFO L158 Benchmark]: TraceAbstraction took 27648.34ms. Allocated memory was 195.0MB in the beginning and 641.7MB in the end (delta: 446.7MB). Free memory was 130.8MB in the beginning and 390.3MB in the end (delta: -259.5MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. [2024-11-12 07:39:26,342 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 641.7MB. Free memory is still 390.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:39:26,342 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.17ms. Allocated memory is still 155.2MB. Free memory was 106.8MB in the beginning and 106.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.07ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 66.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.62ms. Allocated memory is still 155.2MB. Free memory was 65.8MB in the beginning and 61.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.65ms. Allocated memory was 155.2MB in the beginning and 195.0MB in the end (delta: 39.8MB). Free memory was 61.9MB in the beginning and 165.4MB in the end (delta: -103.5MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * RCFGBuilder took 640.06ms. Allocated memory is still 195.0MB. Free memory was 165.4MB in the beginning and 131.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 27648.34ms. Allocated memory was 195.0MB in the beginning and 641.7MB in the end (delta: 446.7MB). Free memory was 130.8MB in the beginning and 390.3MB in the end (delta: -259.5MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 641.7MB. Free memory is still 390.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of bitwiseAnd at line 67, overapproximation of someBinaryArithmeticFLOAToperation at line 77. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -5, 0, 256, 44772, 5.9, 7.6, 64.2, 128.75, 8, 3135928546 }; [L47] signed short int last_1_WrapperStruct00_var_1_1 = -5; [L48] unsigned long int last_1_WrapperStruct00_var_1_11 = 8; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L98] EXPR WrapperStruct00.var_1_1 [L98] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L99] EXPR WrapperStruct00.var_1_11 [L99] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L109] RET updateLastVariables() [L110] CALL updateVariables() [L81] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L82] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L82] 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=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L83] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L84] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L85] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L86] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L87] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_8 [L88] EXPR WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_8 [L88] EXPR WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L88] EXPR (WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L89] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_9 [L90] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_9 [L90] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L90] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L91] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_10 [L92] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_10 [L92] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L92] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L93] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L94] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L95] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L110] RET updateVariables() [L111] CALL step() [L52] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_1; [L53] WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L53] COND TRUE WrapperStruct00.var_1_4 [L54] WrapperStruct00.var_1_5 = last_1_WrapperStruct00_var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L60] EXPR WrapperStruct00.var_1_5 [L60] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L60] COND TRUE WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5 [L61] EXPR WrapperStruct00.var_1_5 [L61] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_5 + -16) [L67] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L67] EXPR WrapperStruct00.var_1_5 & last_1_WrapperStruct00_var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L67] COND TRUE last_1_WrapperStruct00_var_1_11 >= (WrapperStruct00.var_1_5 & last_1_WrapperStruct00_var_1_11) [L68] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] EXPR ((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] EXPR ((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) < ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) : ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11)) [L68] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] EXPR ((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] EXPR ((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) < ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) : ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] WrapperStruct00.var_1_11 = ((((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) < ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) : ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11)))) [L76] EXPR WrapperStruct00.var_1_1 [L76] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L76] COND TRUE WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5 [L77] EXPR WrapperStruct00.var_1_8 [L77] EXPR WrapperStruct00.var_1_9 [L77] EXPR WrapperStruct00.var_1_10 [L77] WrapperStruct00.var_1_7 = (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR (WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1) [L102] EXPR WrapperStruct00.var_1_1 [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR (WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR ((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1)) [L102] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1) [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR ((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR (((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1))) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1) [L102] EXPR WrapperStruct00.var_1_1 [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1 [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_9 [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR (((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1))) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR ((((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1))) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1)) && ((last_1_WrapperStruct00_var_1_11 >= (WrapperStruct00.var_1_5 & last_1_WrapperStruct00_var_1_11)) ? (WrapperStruct00.var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) < ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) : ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11)))))) : ((5.7 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned long int) last_1_WrapperStruct00_var_1_11)) : (WrapperStruct00.var_1_11 == ((unsigned long int) last_1_WrapperStruct00_var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102-L103] return ((((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1))) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1)) && ((last_1_WrapperStruct00_var_1_11 >= (WrapperStruct00.var_1_5 & last_1_WrapperStruct00_var_1_11)) ? (WrapperStruct00.var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) < ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) : ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11)))))) : ((5.7 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned long int) last_1_WrapperStruct00_var_1_11)) : (WrapperStruct00.var_1_11 == ((unsigned long int) last_1_WrapperStruct00_var_1_11)))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.5s, OverallIterations: 21, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6628 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6622 mSDsluCounter, 11336 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8615 mSDsCounter, 929 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9698 IncrementalHoareTripleChecker+Invalid, 10627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 929 mSolverCounterUnsat, 2721 mSDtfsCounter, 9698 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1165 GetRequests, 925 SyntacticMatches, 1 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=857occurred in iteration=4, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 2837 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 2312 NumberOfCodeBlocks, 2312 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2380 ConstructedInterpolants, 0 QuantifiedInterpolants, 11344 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1148 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 3516/3600 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:39:26,380 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-22.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 e82610752a88d395729d794c88c73268443026b48dc2e1bfb9e59d87e1051314 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:39:28,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:39:28,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:39:28,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:39:28,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:39:28,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:39:28,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:39:28,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:39:28,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:39:28,365 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:39:28,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:39:28,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:39:28,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:39:28,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:39:28,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:39:28,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:39:28,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:39:28,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:39:28,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:39:28,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:39:28,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:39:28,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:39:28,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:39:28,371 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:39:28,371 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:39:28,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:39:28,372 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:39:28,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:39:28,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:39:28,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:39:28,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:39:28,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:39:28,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:39:28,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:39:28,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:28,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:39:28,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:39:28,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:39:28,387 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:39:28,387 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:39:28,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:39:28,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:39:28,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:39:28,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:39:28,388 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 -> e82610752a88d395729d794c88c73268443026b48dc2e1bfb9e59d87e1051314 [2024-11-12 07:39:28,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:39:28,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:39:28,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:39:28,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:39:28,694 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:39:28,695 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-22.i [2024-11-12 07:39:30,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:39:30,225 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:39:30,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-22.i [2024-11-12 07:39:30,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76da5b32a/b1a11ba104b04f82ab5aa302cbe671e3/FLAG6e0a5409b [2024-11-12 07:39:30,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76da5b32a/b1a11ba104b04f82ab5aa302cbe671e3 [2024-11-12 07:39:30,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:39:30,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:39:30,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:30,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:39:30,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:39:30,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:30" (1/1) ... [2024-11-12 07:39:30,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758e0214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:30, skipping insertion in model container [2024-11-12 07:39:30,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:30" (1/1) ... [2024-11-12 07:39:30,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:39:30,443 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-22.i[916,929] [2024-11-12 07:39:30,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:30,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:39:30,522 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-22.i[916,929] [2024-11-12 07:39:30,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:30,590 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:39:30,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:30 WrapperNode [2024-11-12 07:39:30,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:30,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:30,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:39:30,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:39:30,598 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:30" (1/1) ... [2024-11-12 07:39:30,619 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:30" (1/1) ... [2024-11-12 07:39:30,656 INFO L138 Inliner]: procedures = 37, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 393 [2024-11-12 07:39:30,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:30,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:39:30,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:39:30,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:39:30,670 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:30" (1/1) ... [2024-11-12 07:39:30,670 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:30" (1/1) ... [2024-11-12 07:39:30,676 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:30" (1/1) ... [2024-11-12 07:39:30,701 INFO L175 MemorySlicer]: Split 97 memory accesses to 2 slices as follows [2, 95]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 25 writes are split as follows [0, 25]. [2024-11-12 07:39:30,701 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:30" (1/1) ... [2024-11-12 07:39:30,701 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:30" (1/1) ... [2024-11-12 07:39:30,722 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:30" (1/1) ... [2024-11-12 07:39:30,730 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:30" (1/1) ... [2024-11-12 07:39:30,733 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:30" (1/1) ... [2024-11-12 07:39:30,740 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:30" (1/1) ... [2024-11-12 07:39:30,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:39:30,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:39:30,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:39:30,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:39:30,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:30" (1/1) ... [2024-11-12 07:39:30,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:30,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:39:30,776 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:30,778 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:30,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:39:30,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:39:30,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:39:30,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:39:30,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:39:30,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:39:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:39:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:39:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:39:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:39:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:39:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-12 07:39:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-12 07:39:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:39:30,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:39:30,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-12 07:39:30,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-12 07:39:30,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:39:30,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:39:30,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:39:30,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:39:30,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-12 07:39:30,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-12 07:39:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:39:30,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:39:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:39:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:39:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:39:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:39:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:39:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:39:30,939 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:39:30,941 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:39:32,802 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-12 07:39:32,802 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:39:32,819 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:39:32,819 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:39:32,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:32 BoogieIcfgContainer [2024-11-12 07:39:32,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:39:32,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:39:32,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:39:32,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:39:32,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:39:30" (1/3) ... [2024-11-12 07:39:32,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9a8fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:32, skipping insertion in model container [2024-11-12 07:39:32,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:30" (2/3) ... [2024-11-12 07:39:32,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9a8fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:32, skipping insertion in model container [2024-11-12 07:39:32,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:32" (3/3) ... [2024-11-12 07:39:32,834 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-22.i [2024-11-12 07:39:32,847 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:39:32,848 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:39:32,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:39:32,903 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;@34de4958, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:39:32,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:39:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:39:32,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:32,915 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:32,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1037497833, now seen corresponding path program 1 times [2024-11-12 07:39:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028234175] [2024-11-12 07:39:32,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:32,931 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:39:32,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:32,934 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:39:32,935 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:39:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:33,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:39:33,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 07:39:33,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:33,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:33,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028234175] [2024-11-12 07:39:33,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028234175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:33,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:33,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:39:33,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035673716] [2024-11-12 07:39:33,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:33,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:39:33,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:33,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:39:33,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:39:33,314 INFO L87 Difference]: Start difference. First operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:33,337 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2024-11-12 07:39:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:39:33,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-12 07:39:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:33,345 INFO L225 Difference]: With dead ends: 188 [2024-11-12 07:39:33,345 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 07:39:33,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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:39:33,350 INFO L435 NwaCegarLoop]: 129 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, 129 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:39:33,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 07:39:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 07:39:33,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-11-12 07:39:33,386 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 89 [2024-11-12 07:39:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:33,386 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-11-12 07:39:33,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-11-12 07:39:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:39:33,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:33,389 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:33,590 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:39:33,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:33,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash -8583379, now seen corresponding path program 1 times [2024-11-12 07:39:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:33,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641334073] [2024-11-12 07:39:33,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:33,593 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:39:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:33,595 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:39:33,596 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:39:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:33,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:33,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-12 07:39:33,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:33,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:33,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641334073] [2024-11-12 07:39:33,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641334073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:33,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:33,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:39:33,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712476977] [2024-11-12 07:39:33,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:33,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:39:33,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:33,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:39:33,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:39:33,956 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:34,015 INFO L93 Difference]: Finished difference Result 183 states and 258 transitions. [2024-11-12 07:39:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:39:34,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-12 07:39:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:34,017 INFO L225 Difference]: With dead ends: 183 [2024-11-12 07:39:34,017 INFO L226 Difference]: Without dead ends: 94 [2024-11-12 07:39:34,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 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:34,018 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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:34,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 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:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-12 07:39:34,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-12 07:39:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:39:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2024-11-12 07:39:34,026 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 92 [2024-11-12 07:39:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:34,027 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2024-11-12 07:39:34,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:39:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2024-11-12 07:39:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:39:34,029 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:34,030 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,039 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 (3)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:34,230 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:39:34,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:34,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:34,231 INFO L85 PathProgramCache]: Analyzing trace with hash -902069717, now seen corresponding path program 1 times [2024-11-12 07:39:34,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:34,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030939458] [2024-11-12 07:39:34,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:34,232 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:39:34,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:34,254 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:39:34,268 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:39:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:34,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 07:39:34,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:34,757 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 59 treesize of output 58 [2024-11-12 07:39:34,863 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 91 treesize of output 79 [2024-11-12 07:39:35,055 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 16 treesize of output 12 [2024-11-12 07:39:35,092 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 36 treesize of output 29 [2024-11-12 07:39:35,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:35,190 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 48 treesize of output 35 [2024-11-12 07:39:35,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:35,215 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 48 treesize of output 35 [2024-11-12 07:39:35,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:35,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 81 treesize of output 51 [2024-11-12 07:39:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:35,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:35,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:35,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030939458] [2024-11-12 07:39:35,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030939458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:35,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:35,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:39:35,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74489580] [2024-11-12 07:39:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:35,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:39:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:39:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:39:35,313 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:42,856 INFO L93 Difference]: Finished difference Result 552 states and 771 transitions. [2024-11-12 07:39:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:39:42,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-12 07:39:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:42,869 INFO L225 Difference]: With dead ends: 552 [2024-11-12 07:39:42,871 INFO L226 Difference]: Without dead ends: 461 [2024-11-12 07:39:42,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:39:42,889 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 552 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:42,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1000 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-12 07:39:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-12 07:39:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 313. [2024-11-12 07:39:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 272 states have (on average 1.3602941176470589) internal successors, (370), 272 states have internal predecessors, (370), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 07:39:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 442 transitions. [2024-11-12 07:39:42,936 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 442 transitions. Word has length 92 [2024-11-12 07:39:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:42,937 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 442 transitions. [2024-11-12 07:39:42,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 442 transitions. [2024-11-12 07:39:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 07:39:42,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:42,939 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,951 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 (4)] Forceful destruction successful, exit code 0 [2024-11-12 07:39:43,139 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:39:43,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:43,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 278484247, now seen corresponding path program 1 times [2024-11-12 07:39:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198807855] [2024-11-12 07:39:43,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:43,141 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:39:43,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:43,142 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:39:43,143 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:39:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:43,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:43,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:43,423 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 21 treesize of output 9 [2024-11-12 07:39:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:43,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:43,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:43,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198807855] [2024-11-12 07:39:43,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198807855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:43,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:43,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:43,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388151602] [2024-11-12 07:39:43,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:43,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:43,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:43,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:43,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:43,451 INFO L87 Difference]: Start difference. First operand 313 states and 442 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:43,471 INFO L93 Difference]: Finished difference Result 493 states and 695 transitions. [2024-11-12 07:39:43,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:43,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-12 07:39:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:43,474 INFO L225 Difference]: With dead ends: 493 [2024-11-12 07:39:43,474 INFO L226 Difference]: Without dead ends: 226 [2024-11-12 07:39:43,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 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:43,475 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:43,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-12 07:39:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2024-11-12 07:39:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 193 states have (on average 1.3367875647668395) internal successors, (258), 193 states have internal predecessors, (258), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:39:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 312 transitions. [2024-11-12 07:39:43,486 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 312 transitions. Word has length 93 [2024-11-12 07:39:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:43,487 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 312 transitions. [2024-11-12 07:39:43,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 312 transitions. [2024-11-12 07:39:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 07:39:43,488 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:43,488 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,500 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:39:43,689 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:39:43,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:43,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1801465933, now seen corresponding path program 1 times [2024-11-12 07:39:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:43,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731330884] [2024-11-12 07:39:43,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:43,691 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:39:43,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:43,698 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:39:43,699 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:39:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:43,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 07:39:43,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:44,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:44,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:44,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731330884] [2024-11-12 07:39:44,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731330884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:44,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:44,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:44,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349555712] [2024-11-12 07:39:44,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:44,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:44,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:44,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:44,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:44,020 INFO L87 Difference]: Start difference. First operand 224 states and 312 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:44,188 INFO L93 Difference]: Finished difference Result 415 states and 577 transitions. [2024-11-12 07:39:44,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:44,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-12 07:39:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:44,191 INFO L225 Difference]: With dead ends: 415 [2024-11-12 07:39:44,191 INFO L226 Difference]: Without dead ends: 237 [2024-11-12 07:39:44,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 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:44,193 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 17 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:44,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 239 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:39:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-12 07:39:44,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 152. [2024-11-12 07:39:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:39:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 209 transitions. [2024-11-12 07:39:44,203 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 209 transitions. Word has length 93 [2024-11-12 07:39:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:44,203 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 209 transitions. [2024-11-12 07:39:44,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 209 transitions. [2024-11-12 07:39:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:39:44,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:44,204 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,219 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:39:44,404 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:39:44,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:44,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:44,406 INFO L85 PathProgramCache]: Analyzing trace with hash -498818970, now seen corresponding path program 1 times [2024-11-12 07:39:44,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:44,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742462244] [2024-11-12 07:39:44,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:44,406 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:39:44,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:44,409 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:39:44,410 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:39:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:44,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 07:39:44,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:44,861 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 59 treesize of output 58 [2024-11-12 07:39:44,968 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 91 treesize of output 79 [2024-11-12 07:39:45,134 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 14 treesize of output 10 [2024-11-12 07:39:45,196 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 26 treesize of output 14 [2024-11-12 07:39:45,236 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:39:45,258 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:39:45,308 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 51 treesize of output 33 [2024-11-12 07:39:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:45,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:45,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:45,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742462244] [2024-11-12 07:39:45,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742462244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:45,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:45,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:39:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594905702] [2024-11-12 07:39:45,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:45,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:39:45,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:45,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:39:45,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:39:45,400 INFO L87 Difference]: Start difference. First operand 152 states and 209 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:48,436 INFO L93 Difference]: Finished difference Result 324 states and 442 transitions. [2024-11-12 07:39:48,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:39:48,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-12 07:39:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:48,437 INFO L225 Difference]: With dead ends: 324 [2024-11-12 07:39:48,437 INFO L226 Difference]: Without dead ends: 234 [2024-11-12 07:39:48,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:39:48,438 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 177 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:48,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 580 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-12 07:39:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-12 07:39:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 160. [2024-11-12 07:39:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 139 states have internal predecessors, (184), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:39:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 220 transitions. [2024-11-12 07:39:48,445 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 220 transitions. Word has length 94 [2024-11-12 07:39:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:48,445 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 220 transitions. [2024-11-12 07:39:48,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 220 transitions. [2024-11-12 07:39:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:39:48,446 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:48,447 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 07:39:48,647 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:39:48,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:48,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash 393840305, now seen corresponding path program 1 times [2024-11-12 07:39:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840692490] [2024-11-12 07:39:48,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:48,648 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:39:48,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:48,650 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:39:48,660 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:39:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:48,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:39:48,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:48,928 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 21 treesize of output 9 [2024-11-12 07:39:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:39:48,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:39:48,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:48,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840692490] [2024-11-12 07:39:48,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840692490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:48,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:48,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:48,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950501712] [2024-11-12 07:39:48,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:48,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:48,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:48,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:48,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:48,949 INFO L87 Difference]: Start difference. First operand 160 states and 220 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:48,968 INFO L93 Difference]: Finished difference Result 252 states and 346 transitions. [2024-11-12 07:39:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:48,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-12 07:39:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:48,973 INFO L225 Difference]: With dead ends: 252 [2024-11-12 07:39:48,973 INFO L226 Difference]: Without dead ends: 154 [2024-11-12 07:39:48,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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:48,974 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:48,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-12 07:39:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-12 07:39:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 133 states have (on average 1.300751879699248) internal successors, (173), 133 states have internal predecessors, (173), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:39:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 209 transitions. [2024-11-12 07:39:48,984 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 209 transitions. Word has length 94 [2024-11-12 07:39:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:48,984 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 209 transitions. [2024-11-12 07:39:48,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:39:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 209 transitions. [2024-11-12 07:39:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 07:39:48,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:48,985 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,996 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:39:49,186 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:39:49,186 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:49,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:49,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1228323282, now seen corresponding path program 1 times [2024-11-12 07:39:49,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:39:49,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611544473] [2024-11-12 07:39:49,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:49,187 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:39:49,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:39:49,188 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:39:49,189 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:39:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:49,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 07:39:49,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:49,590 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 24 treesize of output 9 [2024-11-12 07:39:49,611 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 9 treesize of output 3 [2024-11-12 07:39:49,642 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:39:49,758 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:39:49,821 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:39:49,881 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:39:49,966 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:39:50,076 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 22 treesize of output 10 [2024-11-12 07:39:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 18 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-12 07:39:50,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:50,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 15 [2024-11-12 07:39:50,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:39:50,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611544473] [2024-11-12 07:39:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611544473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:50,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [261417126] [2024-11-12 07:39:50,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:50,531 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:39:50,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:39:50,532 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 07:39:50,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-12 07:39:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:51,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 07:39:51,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:39:51,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2024-11-12 07:39:51,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:39:51,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2024-11-12 07:39:51,776 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 12 treesize of output 8 [2024-11-12 07:39:52,210 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 33 treesize of output 17 [2024-11-12 07:39:52,353 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 33 treesize of output 17 [2024-11-12 07:39:52,465 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 33 treesize of output 17 [2024-11-12 07:39:52,609 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 33 treesize of output 17 [2024-11-12 07:39:52,776 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 26 treesize of output 14 [2024-11-12 07:39:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 62 proven. 18 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 07:39:52,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:39:53,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [261417126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:39:53,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:39:53,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-11-12 07:39:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545382602] [2024-11-12 07:39:53,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:39:53,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 07:39:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:39:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 07:39:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:39:53,064 INFO L87 Difference]: Start difference. First operand 154 states and 209 transitions. Second operand has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-12 07:39:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:59,812 INFO L93 Difference]: Finished difference Result 298 states and 397 transitions. [2024-11-12 07:39:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 07:39:59,813 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 95 [2024-11-12 07:39:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:59,814 INFO L225 Difference]: With dead ends: 298 [2024-11-12 07:39:59,814 INFO L226 Difference]: Without dead ends: 210 [2024-11-12 07:39:59,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 324 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 07:39:59,815 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 163 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:59,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 599 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-12 07:39:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-12 07:39:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 164. [2024-11-12 07:39:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:39:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 217 transitions. [2024-11-12 07:39:59,824 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 217 transitions. Word has length 95 [2024-11-12 07:39:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:59,824 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 217 transitions. [2024-11-12 07:39:59,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-12 07:39:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 217 transitions. [2024-11-12 07:39:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 07:39:59,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:59,826 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 07:40:00,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-12 07:40:00,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 07:40:00,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:00,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1362336788, now seen corresponding path program 1 times [2024-11-12 07:40:00,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:00,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967155707] [2024-11-12 07:40:00,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:00,228 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:00,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:00,230 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:40:00,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 07:40:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 07:40:00,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:00,805 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:00,810 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 23 treesize of output 23 [2024-11-12 07:40:00,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:00,849 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 39 treesize of output 26 [2024-11-12 07:40:00,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:00,872 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 39 treesize of output 26 [2024-11-12 07:40:00,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:00,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 72 treesize of output 42 [2024-11-12 07:40:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:40:00,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:00,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:00,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967155707] [2024-11-12 07:40:00,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967155707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:00,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:00,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009379156] [2024-11-12 07:40:00,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:00,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:00,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:00,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:00,922 INFO L87 Difference]: Start difference. First operand 164 states and 217 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:40:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:02,626 INFO L93 Difference]: Finished difference Result 253 states and 338 transitions. [2024-11-12 07:40:02,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:02,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-12 07:40:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:02,632 INFO L225 Difference]: With dead ends: 253 [2024-11-12 07:40:02,633 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 07:40:02,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 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:02,634 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 98 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:02,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 430 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 07:40:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 07:40:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2024-11-12 07:40:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:40:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 216 transitions. [2024-11-12 07:40:02,646 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 216 transitions. Word has length 95 [2024-11-12 07:40:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:02,646 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 216 transitions. [2024-11-12 07:40:02,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:40:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 216 transitions. [2024-11-12 07:40:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:40:02,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:02,647 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,661 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 (11)] Forceful destruction successful, exit code 0 [2024-11-12 07:40:02,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:40:02,848 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:02,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1584848223, now seen corresponding path program 1 times [2024-11-12 07:40:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:02,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588791882] [2024-11-12 07:40:02,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:02,849 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:02,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:02,850 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:40:02,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 07:40:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:40:03,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:40:03,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:03,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:03,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588791882] [2024-11-12 07:40:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588791882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:03,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060795659] [2024-11-12 07:40:03,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:03,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:03,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:03,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:03,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:03,171 INFO L87 Difference]: Start difference. First operand 164 states and 216 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:40:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:03,972 INFO L93 Difference]: Finished difference Result 255 states and 339 transitions. [2024-11-12 07:40:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:03,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-12 07:40:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:03,975 INFO L225 Difference]: With dead ends: 255 [2024-11-12 07:40:03,975 INFO L226 Difference]: Without dead ends: 167 [2024-11-12 07:40:03,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 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,975 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 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.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:03,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:40:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-12 07:40:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-12 07:40:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.2708333333333333) internal successors, (183), 144 states have internal predecessors, (183), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:40:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 219 transitions. [2024-11-12 07:40:03,984 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 219 transitions. Word has length 96 [2024-11-12 07:40:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:03,986 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 219 transitions. [2024-11-12 07:40:03,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:40:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 219 transitions. [2024-11-12 07:40:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:40:03,987 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:03,987 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-12 07:40:04,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:40:04,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:04,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:04,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1900772447, now seen corresponding path program 1 times [2024-11-12 07:40:04,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:04,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104796454] [2024-11-12 07:40:04,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:04,189 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:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:04,191 INFO L229 MonitoredProcess]: Starting monitored process 13 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:04,192 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 (13)] Waiting until timeout for monitored process