./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-?-c7c6ca5-m [2024-11-09 02:00:33,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:00:33,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:00:33,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:00:33,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:00:33,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:00:33,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:00:33,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:00:33,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:00:33,820 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:00:33,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:00:33,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:00:33,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:00:33,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:00:33,823 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:00:33,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:00:33,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:00:33,824 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:00:33,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:00:33,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:00:33,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:00:33,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:00:33,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:00:33,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:00:33,829 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:00:33,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:00:33,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:00:33,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:00:33,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:00:33,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:00:33,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:00:33,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:00:33,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:00:33,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:00:33,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:00:33,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:00:33,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:00:33,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:00:33,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:00:33,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:00:33,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:00:33,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:00:33,834 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-09 02:00:34,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:00:34,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:00:34,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:00:34,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:00:34,113 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:00:34,115 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-09 02:00:35,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:00:35,753 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:00:35,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-22.i [2024-11-09 02:00:35,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bc80da20/2e86d9d3a6ca4d0399ffdcdc5b32d728/FLAG7ba04e58e [2024-11-09 02:00:35,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bc80da20/2e86d9d3a6ca4d0399ffdcdc5b32d728 [2024-11-09 02:00:35,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:00:35,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:00:35,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:00:35,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:00:35,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:00:35,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:00:35" (1/1) ... [2024-11-09 02:00:35,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2557b314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:35, skipping insertion in model container [2024-11-09 02:00:35,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:00:35" (1/1) ... [2024-11-09 02:00:35,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:00:35,999 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-09 02:00:36,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:00:36,059 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:00:36,068 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-09 02:00:36,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:00:36,138 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:00:36,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36 WrapperNode [2024-11-09 02:00:36,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:00:36,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:00:36,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:00:36,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:00:36,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,210 INFO L138 Inliner]: procedures = 30, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2024-11-09 02:00:36,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:00:36,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:00:36,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:00:36,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:00:36,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,237 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:00:36,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:00:36,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:00:36,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:00:36,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:00:36,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (1/1) ... [2024-11-09 02:00:36,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:00:36,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:00:36,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:00:36,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:00:36,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:00:36,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:00:36,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:00:36,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:00:36,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:00:36,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:00:36,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:00:36,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:00:36,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:00:36,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:00:36,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:00:36,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:00:36,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:00:36,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:00:37,072 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-09 02:00:37,072 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:00:37,088 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:00:37,088 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:00:37,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:00:37 BoogieIcfgContainer [2024-11-09 02:00:37,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:00:37,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:00:37,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:00:37,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:00:37,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:00:35" (1/3) ... [2024-11-09 02:00:37,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3755a367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:00:37, skipping insertion in model container [2024-11-09 02:00:37,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:00:36" (2/3) ... [2024-11-09 02:00:37,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3755a367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:00:37, skipping insertion in model container [2024-11-09 02:00:37,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:00:37" (3/3) ... [2024-11-09 02:00:37,099 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-22.i [2024-11-09 02:00:37,112 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:00:37,112 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:00:37,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:00:37,176 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;@6b5ee37e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:00:37,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:00:37,179 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-09 02:00:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 02:00:37,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:37,190 INFO L215 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-09 02:00:37,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:37,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1659460873, now seen corresponding path program 1 times [2024-11-09 02:00:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:37,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858209345] [2024-11-09 02:00:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:37,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:37,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:37,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:37,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:37,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:37,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:37,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:37,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:37,603 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-09 02:00:37,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858209345] [2024-11-09 02:00:37,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858209345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:37,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:37,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:00:37,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504506191] [2024-11-09 02:00:37,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:37,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:00:37,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:37,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:00:37,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:00:37,648 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-09 02:00:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:37,678 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2024-11-09 02:00:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:00:37,680 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-09 02:00:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:37,686 INFO L225 Difference]: With dead ends: 203 [2024-11-09 02:00:37,686 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 02:00:37,688 INFO L431 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-09 02:00:37,691 INFO L432 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-09 02:00:37,692 INFO L433 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-09 02:00:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 02:00:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-09 02:00:37,739 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-09 02:00:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-09 02:00:37,742 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 90 [2024-11-09 02:00:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:37,743 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-09 02:00:37,743 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-09 02:00:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-09 02:00:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 02:00:37,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:37,747 INFO L215 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-09 02:00:37,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:00:37,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:37,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:37,749 INFO L85 PathProgramCache]: Analyzing trace with hash 328924025, now seen corresponding path program 1 times [2024-11-09 02:00:37,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:37,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564889867] [2024-11-09 02:00:37,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:37,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:39,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:39,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:39,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:39,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:39,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:39,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:39,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:39,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:39,188 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-09 02:00:39,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:39,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564889867] [2024-11-09 02:00:39,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564889867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:39,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:39,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:00:39,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136608654] [2024-11-09 02:00:39,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:39,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:00:39,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:39,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:00:39,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:00:39,199 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-09 02:00:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:40,336 INFO L93 Difference]: Finished difference Result 747 states and 1086 transitions. [2024-11-09 02:00:40,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:00:40,336 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-09 02:00:40,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:40,343 INFO L225 Difference]: With dead ends: 747 [2024-11-09 02:00:40,343 INFO L226 Difference]: Without dead ends: 649 [2024-11-09 02:00:40,344 INFO L431 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-09 02:00:40,345 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 1045 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:40,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 891 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:00:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-09 02:00:40,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 481. [2024-11-09 02:00:40,404 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-09 02:00:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 704 transitions. [2024-11-09 02:00:40,412 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 704 transitions. Word has length 90 [2024-11-09 02:00:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:40,413 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 704 transitions. [2024-11-09 02:00:40,414 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-09 02:00:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 704 transitions. [2024-11-09 02:00:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 02:00:40,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:40,419 INFO L215 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-09 02:00:40,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:00:40,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:40,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash 915730039, now seen corresponding path program 1 times [2024-11-09 02:00:40,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:40,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481450372] [2024-11-09 02:00:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:40,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:41,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:41,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:41,355 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-09 02:00:41,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:41,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481450372] [2024-11-09 02:00:41,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481450372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:41,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:41,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:00:41,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182513787] [2024-11-09 02:00:41,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:41,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:00:41,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:41,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:00:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:00:41,359 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-09 02:00:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:42,377 INFO L93 Difference]: Finished difference Result 1335 states and 1946 transitions. [2024-11-09 02:00:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:00:42,378 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-09 02:00:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:42,382 INFO L225 Difference]: With dead ends: 1335 [2024-11-09 02:00:42,383 INFO L226 Difference]: Without dead ends: 857 [2024-11-09 02:00:42,385 INFO L431 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-09 02:00:42,386 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 340 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:42,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 621 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:00:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-09 02:00:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 662. [2024-11-09 02:00:42,430 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-09 02:00:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 966 transitions. [2024-11-09 02:00:42,437 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 966 transitions. Word has length 90 [2024-11-09 02:00:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:42,438 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 966 transitions. [2024-11-09 02:00:42,439 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-09 02:00:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 966 transitions. [2024-11-09 02:00:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 02:00:42,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:42,445 INFO L215 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-09 02:00:42,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:00:42,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:42,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:42,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1540153901, now seen corresponding path program 1 times [2024-11-09 02:00:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:42,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832890728] [2024-11-09 02:00:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:42,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:42,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:42,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:42,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:42,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:42,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:42,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:42,935 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-09 02:00:42,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:42,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832890728] [2024-11-09 02:00:42,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832890728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:42,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:42,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:00:42,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017935210] [2024-11-09 02:00:42,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:42,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:00:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:42,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:00:42,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:00:42,941 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-09 02:00:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:43,285 INFO L93 Difference]: Finished difference Result 1890 states and 2754 transitions. [2024-11-09 02:00:43,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:00:43,286 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-09 02:00:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:43,293 INFO L225 Difference]: With dead ends: 1890 [2024-11-09 02:00:43,293 INFO L226 Difference]: Without dead ends: 1231 [2024-11-09 02:00:43,295 INFO L431 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-09 02:00:43,296 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:43,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 517 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:00:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-09 02:00:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 857. [2024-11-09 02:00:43,359 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-09 02:00:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1250 transitions. [2024-11-09 02:00:43,367 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1250 transitions. Word has length 91 [2024-11-09 02:00:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:43,368 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1250 transitions. [2024-11-09 02:00:43,369 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-09 02:00:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1250 transitions. [2024-11-09 02:00:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 02:00:43,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:43,374 INFO L215 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-09 02:00:43,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:00:43,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:43,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1109130490, now seen corresponding path program 1 times [2024-11-09 02:00:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:43,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792434470] [2024-11-09 02:00:43,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:43,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:43,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:43,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:43,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:43,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:43,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:43,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:43,482 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-09 02:00:43,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:43,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792434470] [2024-11-09 02:00:43,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792434470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:43,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:43,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:00:43,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535511949] [2024-11-09 02:00:43,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:43,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:00:43,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:43,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:00:43,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:00:43,485 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-09 02:00:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:43,574 INFO L93 Difference]: Finished difference Result 1494 states and 2177 transitions. [2024-11-09 02:00:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:00:43,575 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-09 02:00:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:43,579 INFO L225 Difference]: With dead ends: 1494 [2024-11-09 02:00:43,579 INFO L226 Difference]: Without dead ends: 640 [2024-11-09 02:00:43,580 INFO L431 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-09 02:00:43,581 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:43,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:00:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-09 02:00:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 627. [2024-11-09 02:00:43,607 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-09 02:00:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 904 transitions. [2024-11-09 02:00:43,610 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 904 transitions. Word has length 92 [2024-11-09 02:00:43,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:43,610 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 904 transitions. [2024-11-09 02:00:43,611 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-09 02:00:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 904 transitions. [2024-11-09 02:00:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 02:00:43,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:43,612 INFO L215 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-09 02:00:43,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:00:43,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:43,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1007745668, now seen corresponding path program 1 times [2024-11-09 02:00:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522096300] [2024-11-09 02:00:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,504 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-09 02:00:44,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:44,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522096300] [2024-11-09 02:00:44,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522096300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:00:44,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362050334] [2024-11-09 02:00:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:44,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:00:44,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:00:44,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:00:44,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:00:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:44,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 02:00:44,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:00:44,835 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-09 02:00:45,154 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-09 02:00:45,387 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-09 02:00:45,432 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-09 02:00:45,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:45,541 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-09 02:00:45,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:00:45,563 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-09 02:00:45,657 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-09 02:00:45,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:00:46,165 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-09 02:00:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362050334] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 02:00:46,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:00:46,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 9] total 20 [2024-11-09 02:00:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062988022] [2024-11-09 02:00:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:46,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:00:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:46,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:00:46,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-09 02:00:46,168 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-09 02:00:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:46,608 INFO L93 Difference]: Finished difference Result 1203 states and 1739 transitions. [2024-11-09 02:00:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:00:46,609 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-09 02:00:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:46,615 INFO L225 Difference]: With dead ends: 1203 [2024-11-09 02:00:46,616 INFO L226 Difference]: Without dead ends: 730 [2024-11-09 02:00:46,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-11-09 02:00:46,618 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 120 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-09 02:00:46,619 INFO L433 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-09 02:00:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-11-09 02:00:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 724. [2024-11-09 02:00:46,659 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-09 02:00:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1044 transitions. [2024-11-09 02:00:46,664 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1044 transitions. Word has length 95 [2024-11-09 02:00:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:46,665 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1044 transitions. [2024-11-09 02:00:46,666 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-09 02:00:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1044 transitions. [2024-11-09 02:00:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 02:00:46,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:46,667 INFO L215 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-09 02:00:46,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 02:00:46,868 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-09 02:00:46,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:46,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:46,869 INFO L85 PathProgramCache]: Analyzing trace with hash -86241146, now seen corresponding path program 1 times [2024-11-09 02:00:46,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:46,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307546083] [2024-11-09 02:00:46,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:46,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:47,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:47,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:47,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:47,586 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-09 02:00:47,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307546083] [2024-11-09 02:00:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307546083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:47,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:47,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:00:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045495166] [2024-11-09 02:00:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:47,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:00:47,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:47,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:00:47,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:00:47,589 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-09 02:00:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:48,119 INFO L93 Difference]: Finished difference Result 1363 states and 1958 transitions. [2024-11-09 02:00:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:00:48,120 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-09 02:00:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:48,123 INFO L225 Difference]: With dead ends: 1363 [2024-11-09 02:00:48,124 INFO L226 Difference]: Without dead ends: 688 [2024-11-09 02:00:48,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:00:48,126 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 599 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-09 02:00:48,126 INFO L433 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-09 02:00:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-09 02:00:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 525. [2024-11-09 02:00:48,152 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-09 02:00:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 754 transitions. [2024-11-09 02:00:48,155 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 754 transitions. Word has length 96 [2024-11-09 02:00:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:48,155 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 754 transitions. [2024-11-09 02:00:48,155 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-09 02:00:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 754 transitions. [2024-11-09 02:00:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 02:00:48,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:48,157 INFO L215 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-09 02:00:48,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:00:48,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:48,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1520928257, now seen corresponding path program 1 times [2024-11-09 02:00:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:48,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199326020] [2024-11-09 02:00:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:49,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:49,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:49,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:49,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:49,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:49,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:49,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:49,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:49,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:49,160 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-09 02:00:49,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:49,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199326020] [2024-11-09 02:00:49,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199326020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:49,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:49,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:00:49,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037373292] [2024-11-09 02:00:49,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:49,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:00:49,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:49,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:00:49,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:00:49,162 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-09 02:00:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:49,719 INFO L93 Difference]: Finished difference Result 1068 states and 1529 transitions. [2024-11-09 02:00:49,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:00:49,720 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-09 02:00:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:49,723 INFO L225 Difference]: With dead ends: 1068 [2024-11-09 02:00:49,724 INFO L226 Difference]: Without dead ends: 687 [2024-11-09 02:00:49,725 INFO L431 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-09 02:00:49,726 INFO L432 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-09 02:00:49,727 INFO L433 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-09 02:00:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-09 02:00:49,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 552. [2024-11-09 02:00:49,754 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-09 02:00:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 790 transitions. [2024-11-09 02:00:49,757 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 790 transitions. Word has length 97 [2024-11-09 02:00:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:49,758 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 790 transitions. [2024-11-09 02:00:49,759 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-09 02:00:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 790 transitions. [2024-11-09 02:00:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 02:00:49,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:49,760 INFO L215 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-09 02:00:49,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:00:49,761 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:49,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:49,761 INFO L85 PathProgramCache]: Analyzing trace with hash -628268982, now seen corresponding path program 1 times [2024-11-09 02:00:49,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:49,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911019134] [2024-11-09 02:00:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:50,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:50,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:50,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:50,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:50,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:50,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:50,581 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-09 02:00:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911019134] [2024-11-09 02:00:50,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911019134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:50,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:50,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:00:50,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063904410] [2024-11-09 02:00:50,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:50,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:00:50,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:50,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:00:50,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:00:50,583 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-09 02:00:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:51,166 INFO L93 Difference]: Finished difference Result 1072 states and 1531 transitions. [2024-11-09 02:00:51,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:00:51,167 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-09 02:00:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:51,170 INFO L225 Difference]: With dead ends: 1072 [2024-11-09 02:00:51,170 INFO L226 Difference]: Without dead ends: 683 [2024-11-09 02:00:51,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:00:51,173 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 411 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:51,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 833 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:00:51,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-09 02:00:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 544. [2024-11-09 02:00:51,202 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-09 02:00:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 776 transitions. [2024-11-09 02:00:51,206 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 776 transitions. Word has length 97 [2024-11-09 02:00:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:51,207 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 776 transitions. [2024-11-09 02:00:51,207 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-09 02:00:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 776 transitions. [2024-11-09 02:00:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 02:00:51,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:51,208 INFO L215 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-09 02:00:51,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:00:51,209 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:51,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1378931136, now seen corresponding path program 1 times [2024-11-09 02:00:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:51,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2726211] [2024-11-09 02:00:51,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:51,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:51,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:51,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:51,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:51,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:51,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:51,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:51,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:51,619 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-09 02:00:51,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:51,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2726211] [2024-11-09 02:00:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2726211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:51,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:51,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:00:51,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313015989] [2024-11-09 02:00:51,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:51,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:00:51,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:51,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:00:51,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:00:51,622 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-09 02:00:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:52,217 INFO L93 Difference]: Finished difference Result 1395 states and 1990 transitions. [2024-11-09 02:00:52,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:00:52,218 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-09 02:00:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:52,223 INFO L225 Difference]: With dead ends: 1395 [2024-11-09 02:00:52,223 INFO L226 Difference]: Without dead ends: 900 [2024-11-09 02:00:52,224 INFO L431 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-09 02:00:52,225 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 231 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:52,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 541 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:00:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-09 02:00:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 559. [2024-11-09 02:00:52,254 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-09 02:00:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 794 transitions. [2024-11-09 02:00:52,257 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 794 transitions. Word has length 97 [2024-11-09 02:00:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:52,257 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 794 transitions. [2024-11-09 02:00:52,257 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-09 02:00:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 794 transitions. [2024-11-09 02:00:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 02:00:52,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:52,259 INFO L215 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-09 02:00:52,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:00:52,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:52,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1316891522, now seen corresponding path program 1 times [2024-11-09 02:00:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:52,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723515396] [2024-11-09 02:00:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:52,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:53,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:53,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:53,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:53,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:53,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:53,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:53,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:53,629 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-09 02:00:53,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:53,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723515396] [2024-11-09 02:00:53,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723515396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:53,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:53,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 02:00:53,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591195588] [2024-11-09 02:00:53,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:53,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 02:00:53,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:53,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 02:00:53,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:00:53,631 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-09 02:00:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:55,776 INFO L93 Difference]: Finished difference Result 1382 states and 1966 transitions. [2024-11-09 02:00:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 02:00:55,777 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-09 02:00:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:55,782 INFO L225 Difference]: With dead ends: 1382 [2024-11-09 02:00:55,782 INFO L226 Difference]: Without dead ends: 1190 [2024-11-09 02:00:55,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2024-11-09 02:00:55,784 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 974 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:55,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 999 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 02:00:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-09 02:00:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 662. [2024-11-09 02:00:55,825 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-09 02:00:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 943 transitions. [2024-11-09 02:00:55,828 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 943 transitions. Word has length 97 [2024-11-09 02:00:55,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:55,828 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 943 transitions. [2024-11-09 02:00:55,828 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-09 02:00:55,828 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 943 transitions. [2024-11-09 02:00:55,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 02:00:55,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:55,830 INFO L215 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-09 02:00:55,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:00:55,830 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:55,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:55,831 INFO L85 PathProgramCache]: Analyzing trace with hash -730085508, now seen corresponding path program 1 times [2024-11-09 02:00:55,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:55,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191531915] [2024-11-09 02:00:55,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:55,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:56,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:56,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:56,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:56,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:56,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:56,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:56,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:56,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:56,511 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-09 02:00:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:56,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191531915] [2024-11-09 02:00:56,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191531915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:56,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:56,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:00:56,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275986283] [2024-11-09 02:00:56,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:56,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:00:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:56,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:00:56,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:00:56,513 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-09 02:00:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:56,759 INFO L93 Difference]: Finished difference Result 1139 states and 1629 transitions. [2024-11-09 02:00:56,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:00:56,760 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-09 02:00:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:56,765 INFO L225 Difference]: With dead ends: 1139 [2024-11-09 02:00:56,765 INFO L226 Difference]: Without dead ends: 847 [2024-11-09 02:00:56,766 INFO L431 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-09 02:00:56,767 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-09 02:00:56,767 INFO L433 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-09 02:00:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-09 02:00:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 662. [2024-11-09 02:00:56,802 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-09 02:00:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 939 transitions. [2024-11-09 02:00:56,805 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 939 transitions. Word has length 97 [2024-11-09 02:00:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:56,806 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 939 transitions. [2024-11-09 02:00:56,806 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-09 02:00:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 939 transitions. [2024-11-09 02:00:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 02:00:56,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:56,807 INFO L215 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-09 02:00:56,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:00:56,808 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:56,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash -511230790, now seen corresponding path program 1 times [2024-11-09 02:00:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:56,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654269279] [2024-11-09 02:00:56,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:56,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:57,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:57,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:57,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:57,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:57,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:57,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:57,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:57,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:57,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:57,731 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-09 02:00:57,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:57,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654269279] [2024-11-09 02:00:57,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654269279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:57,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:57,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:00:57,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718524028] [2024-11-09 02:00:57,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:57,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:00:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:57,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:00:57,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:00:57,734 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-09 02:00:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:58,710 INFO L93 Difference]: Finished difference Result 1313 states and 1860 transitions. [2024-11-09 02:00:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:00:58,711 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-09 02:00:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:58,714 INFO L225 Difference]: With dead ends: 1313 [2024-11-09 02:00:58,714 INFO L226 Difference]: Without dead ends: 717 [2024-11-09 02:00:58,716 INFO L431 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-09 02:00:58,717 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 228 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:00:58,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 658 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:00:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-09 02:00:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 570. [2024-11-09 02:00:58,761 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-09 02:00:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 805 transitions. [2024-11-09 02:00:58,764 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 805 transitions. Word has length 97 [2024-11-09 02:00:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:58,765 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 805 transitions. [2024-11-09 02:00:58,765 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-09 02:00:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 805 transitions. [2024-11-09 02:00:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 02:00:58,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:58,766 INFO L215 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-09 02:00:58,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:00:58,767 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:58,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:58,767 INFO L85 PathProgramCache]: Analyzing trace with hash -72641074, now seen corresponding path program 1 times [2024-11-09 02:00:58,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:58,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656788875] [2024-11-09 02:00:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:58,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:58,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:58,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:58,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:58,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:58,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:58,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:58,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:58,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:58,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:58,982 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-09 02:00:58,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:58,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656788875] [2024-11-09 02:00:58,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656788875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:00:58,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:00:58,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:00:58,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191560407] [2024-11-09 02:00:58,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:00:58,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:00:58,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:00:58,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:00:58,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:00:58,985 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-09 02:00:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:00:59,005 INFO L93 Difference]: Finished difference Result 786 states and 1109 transitions. [2024-11-09 02:00:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:00:59,006 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-09 02:00:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:00:59,008 INFO L225 Difference]: With dead ends: 786 [2024-11-09 02:00:59,008 INFO L226 Difference]: Without dead ends: 278 [2024-11-09 02:00:59,009 INFO L431 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-09 02:00:59,009 INFO L432 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-09 02:00:59,009 INFO L433 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-09 02:00:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-09 02:00:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2024-11-09 02:00:59,023 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-09 02:00:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 369 transitions. [2024-11-09 02:00:59,024 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 369 transitions. Word has length 98 [2024-11-09 02:00:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:00:59,025 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 369 transitions. [2024-11-09 02:00:59,025 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-09 02:00:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 369 transitions. [2024-11-09 02:00:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 02:00:59,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:00:59,027 INFO L215 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-09 02:00:59,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:00:59,027 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:00:59,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:00:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1291021946, now seen corresponding path program 1 times [2024-11-09 02:00:59,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:00:59,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319239323] [2024-11-09 02:00:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:59,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:00:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:59,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:00:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:59,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:00:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:59,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:00:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:59,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:00:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:59,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:00:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:59,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:00:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:59,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:00:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:59,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:00:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:59,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:00:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:00:59,705 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-09 02:00:59,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:00:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319239323] [2024-11-09 02:00:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319239323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:00:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253913907] [2024-11-09 02:00:59,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:00:59,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:00:59,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:00:59,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:00:59,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-09 02:01:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:00,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 02:01:00,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:00,128 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-09 02:01:00,364 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-09 02:01:00,547 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-09 02:01:00,867 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-09 02:01:00,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:00,968 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-09 02:01:01,184 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-09 02:01:01,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:01:01,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253913907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:01,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 02:01:01,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 25 [2024-11-09 02:01:01,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221502866] [2024-11-09 02:01:01,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:01,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 02:01:01,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:01,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 02:01:01,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-09 02:01:01,187 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-09 02:01:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:04,963 INFO L93 Difference]: Finished difference Result 561 states and 771 transitions. [2024-11-09 02:01:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 02:01:04,964 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-09 02:01:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:04,966 INFO L225 Difference]: With dead ends: 561 [2024-11-09 02:01:04,967 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 02:01:04,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=354, Invalid=1626, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 02:01:04,969 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 433 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:04,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 634 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 02:01:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 02:01:04,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 278. [2024-11-09 02:01:04,999 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-09 02:01:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 377 transitions. [2024-11-09 02:01:05,001 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 377 transitions. Word has length 99 [2024-11-09 02:01:05,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:05,002 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 377 transitions. [2024-11-09 02:01:05,002 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-09 02:01:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 377 transitions. [2024-11-09 02:01:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 02:01:05,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:05,003 INFO L215 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-09 02:01:05,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 02:01:05,204 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-09 02:01:05,205 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:05,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:05,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1509876664, now seen corresponding path program 1 times [2024-11-09 02:01:05,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:05,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59543925] [2024-11-09 02:01:05,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:05,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:06,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:06,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:06,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:06,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:06,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:06,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:06,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:06,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:06,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:06,067 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-09 02:01:06,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:06,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59543925] [2024-11-09 02:01:06,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59543925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:01:06,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510533325] [2024-11-09 02:01:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:06,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:01:06,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:01:06,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:01:06,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 02:01:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:06,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 02:01:06,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:06,391 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-09 02:01:06,416 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-09 02:01:06,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 02:01:06,469 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-09 02:01:06,504 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-09 02:01:06,516 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-09 02:01:06,533 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-09 02:01:06,554 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-09 02:01:06,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:01:06,807 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-09 02:01:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510533325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:01:06,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:01:06,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-11-09 02:01:06,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173093569] [2024-11-09 02:01:06,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:01:06,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 02:01:06,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:06,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 02:01:06,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:01:06,810 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-09 02:01:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:07,550 INFO L93 Difference]: Finished difference Result 577 states and 785 transitions. [2024-11-09 02:01:07,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 02:01:07,551 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-09 02:01:07,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:07,553 INFO L225 Difference]: With dead ends: 577 [2024-11-09 02:01:07,553 INFO L226 Difference]: Without dead ends: 374 [2024-11-09 02:01:07,554 INFO L431 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-09 02:01:07,554 INFO L432 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:07,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 418 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:01:07,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-09 02:01:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 288. [2024-11-09 02:01:07,576 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-09 02:01:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 380 transitions. [2024-11-09 02:01:07,580 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 380 transitions. Word has length 99 [2024-11-09 02:01:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:07,581 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 380 transitions. [2024-11-09 02:01:07,581 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-09 02:01:07,581 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 380 transitions. [2024-11-09 02:01:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 02:01:07,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:07,582 INFO L215 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-09 02:01:07,601 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-09 02:01:07,787 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-09 02:01:07,788 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:07,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1684868203, now seen corresponding path program 1 times [2024-11-09 02:01:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397375253] [2024-11-09 02:01:07,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:08,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:08,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:08,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:08,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:08,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:08,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:08,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:08,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:08,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:08,316 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-09 02:01:08,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397375253] [2024-11-09 02:01:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397375253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:08,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:08,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:01:08,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15202831] [2024-11-09 02:01:08,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:08,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:01:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:01:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:01:08,319 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-09 02:01:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:08,936 INFO L93 Difference]: Finished difference Result 621 states and 840 transitions. [2024-11-09 02:01:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:01:08,936 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-09 02:01:08,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:08,939 INFO L225 Difference]: With dead ends: 621 [2024-11-09 02:01:08,939 INFO L226 Difference]: Without dead ends: 519 [2024-11-09 02:01:08,940 INFO L431 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-09 02:01:08,940 INFO L432 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:08,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 610 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:01:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-09 02:01:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 386. [2024-11-09 02:01:08,966 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-09 02:01:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 516 transitions. [2024-11-09 02:01:08,968 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 516 transitions. Word has length 99 [2024-11-09 02:01:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:08,969 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 516 transitions. [2024-11-09 02:01:08,969 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-09 02:01:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 516 transitions. [2024-11-09 02:01:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 02:01:08,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:08,970 INFO L215 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-09 02:01:08,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 02:01:08,971 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:08,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:08,971 INFO L85 PathProgramCache]: Analyzing trace with hash -405004525, now seen corresponding path program 1 times [2024-11-09 02:01:08,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:08,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329699014] [2024-11-09 02:01:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:09,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:09,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:09,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:09,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:09,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:09,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:09,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:09,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:09,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:09,704 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-09 02:01:09,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:09,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329699014] [2024-11-09 02:01:09,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329699014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:09,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:09,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:01:09,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363426538] [2024-11-09 02:01:09,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:09,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:01:09,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:01:09,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:01:09,706 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-09 02:01:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:09,957 INFO L93 Difference]: Finished difference Result 766 states and 1040 transitions. [2024-11-09 02:01:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:01:09,958 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-09 02:01:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:09,960 INFO L225 Difference]: With dead ends: 766 [2024-11-09 02:01:09,960 INFO L226 Difference]: Without dead ends: 472 [2024-11-09 02:01:09,964 INFO L431 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-09 02:01:09,966 INFO L432 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-09 02:01:09,966 INFO L433 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-09 02:01:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-09 02:01:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 410. [2024-11-09 02:01:09,990 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-09 02:01:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 546 transitions. [2024-11-09 02:01:09,992 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 546 transitions. Word has length 99 [2024-11-09 02:01:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:09,993 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 546 transitions. [2024-11-09 02:01:09,993 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-09 02:01:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 546 transitions. [2024-11-09 02:01:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 02:01:09,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:09,994 INFO L215 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-09 02:01:09,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 02:01:09,995 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:09,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash 487654750, now seen corresponding path program 1 times [2024-11-09 02:01:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:09,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896432605] [2024-11-09 02:01:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:10,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:10,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:10,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:10,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:10,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:10,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:10,788 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-09 02:01:10,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:10,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896432605] [2024-11-09 02:01:10,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896432605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:10,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:10,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:01:10,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867521525] [2024-11-09 02:01:10,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:10,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:01:10,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:10,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:01:10,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:01:10,790 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-09 02:01:11,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:11,022 INFO L93 Difference]: Finished difference Result 696 states and 939 transitions. [2024-11-09 02:01:11,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:01:11,023 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-09 02:01:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:11,028 INFO L225 Difference]: With dead ends: 696 [2024-11-09 02:01:11,028 INFO L226 Difference]: Without dead ends: 472 [2024-11-09 02:01:11,029 INFO L431 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-09 02:01:11,029 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 124 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-09 02:01:11,029 INFO L433 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-09 02:01:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-09 02:01:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 410. [2024-11-09 02:01:11,061 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-09 02:01:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 544 transitions. [2024-11-09 02:01:11,063 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 544 transitions. Word has length 99 [2024-11-09 02:01:11,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:11,064 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 544 transitions. [2024-11-09 02:01:11,065 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-09 02:01:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 544 transitions. [2024-11-09 02:01:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 02:01:11,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:11,066 INFO L215 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-09 02:01:11,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 02:01:11,066 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:11,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash 745820188, now seen corresponding path program 1 times [2024-11-09 02:01:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:11,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516120590] [2024-11-09 02:01:11,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:11,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:11,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:01:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:11,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:01:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:11,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:01:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:01:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:11,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:01:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:01:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:11,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:01:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:01:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:01:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:11,220 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-09 02:01:11,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:01:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516120590] [2024-11-09 02:01:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516120590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:11,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:01:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519468739] [2024-11-09 02:01:11,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:11,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:01:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:01:11,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:01:11,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:01:11,221 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-09 02:01:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:11,265 INFO L93 Difference]: Finished difference Result 637 states and 854 transitions. [2024-11-09 02:01:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:01:11,265 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-09 02:01:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:11,268 INFO L225 Difference]: With dead ends: 637 [2024-11-09 02:01:11,268 INFO L226 Difference]: Without dead ends: 413 [2024-11-09 02:01:11,269 INFO L431 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-09 02:01:11,270 INFO L432 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-09 02:01:11,270 INFO L433 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-09 02:01:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-09 02:01:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2024-11-09 02:01:11,298 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-09 02:01:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 539 transitions. [2024-11-09 02:01:11,300 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 539 transitions. Word has length 99 [2024-11-09 02:01:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:11,300 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 539 transitions. [2024-11-09 02:01:11,300 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-09 02:01:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 539 transitions. [2024-11-09 02:01:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 02:01:11,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:11,301 INFO L215 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-09 02:01:11,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 02:01:11,302 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:11,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:11,302 INFO L85 PathProgramCache]: Analyzing trace with hash -173005409, now seen corresponding path program 1 times [2024-11-09 02:01:11,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:01:11,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278456288] [2024-11-09 02:01:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:11,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:01:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:01:11,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:01:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:01:11,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:01:11,473 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:01:11,475 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:01:11,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 02:01:11,481 INFO L407 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-09 02:01:11,546 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:01:11,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:01:11 BoogieIcfgContainer [2024-11-09 02:01:11,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:01:11,549 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:01:11,549 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:01:11,549 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:01:11,551 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:00:37" (3/4) ... [2024-11-09 02:01:11,553 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:01:11,554 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:01:11,554 INFO L158 Benchmark]: Toolchain (without parser) took 35770.98ms. Allocated memory was 165.7MB in the beginning and 813.7MB in the end (delta: 648.0MB). Free memory was 95.8MB in the beginning and 296.0MB in the end (delta: -200.2MB). Peak memory consumption was 449.8MB. Max. memory is 16.1GB. [2024-11-09 02:01:11,554 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:01:11,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.38ms. Allocated memory is still 165.7MB. Free memory was 95.3MB in the beginning and 78.9MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 02:01:11,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.05ms. Allocated memory is still 165.7MB. Free memory was 78.9MB in the beginning and 74.8MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:01:11,558 INFO L158 Benchmark]: Boogie Preprocessor took 66.85ms. Allocated memory is still 165.7MB. Free memory was 74.8MB in the beginning and 71.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:01:11,558 INFO L158 Benchmark]: RCFGBuilder took 809.80ms. Allocated memory is still 165.7MB. Free memory was 71.0MB in the beginning and 107.8MB in the end (delta: -36.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 02:01:11,558 INFO L158 Benchmark]: TraceAbstraction took 34458.21ms. Allocated memory was 165.7MB in the beginning and 813.7MB in the end (delta: 648.0MB). Free memory was 107.5MB in the beginning and 297.0MB in the end (delta: -189.5MB). Peak memory consumption was 461.6MB. Max. memory is 16.1GB. [2024-11-09 02:01:11,558 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 813.7MB. Free memory was 297.0MB in the beginning and 296.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:01:11,559 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 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.38ms. Allocated memory is still 165.7MB. Free memory was 95.3MB in the beginning and 78.9MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.05ms. Allocated memory is still 165.7MB. Free memory was 78.9MB in the beginning and 74.8MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.85ms. Allocated memory is still 165.7MB. Free memory was 74.8MB in the beginning and 71.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 809.80ms. Allocated memory is still 165.7MB. Free memory was 71.0MB in the beginning and 107.8MB in the end (delta: -36.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34458.21ms. Allocated memory was 165.7MB in the beginning and 813.7MB in the end (delta: 648.0MB). Free memory was 107.5MB in the beginning and 297.0MB in the end (delta: -189.5MB). Peak memory consumption was 461.6MB. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 813.7MB. Free memory was 297.0MB in the beginning and 296.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of 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: 34.3s, OverallIterations: 21, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6628 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6622 mSDsluCounter, 11336 SdHoareTripleChecker+Invalid, 9.5s 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, 4.3s 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.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 2837 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.7s 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-09 02:01:11,624 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-?-c7c6ca5-m [2024-11-09 02:01:13,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:01:13,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:01:13,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:01:13,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:01:14,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:01:14,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:01:14,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:01:14,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:01:14,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:01:14,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:01:14,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:01:14,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:01:14,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:01:14,019 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:01:14,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:01:14,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:01:14,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:01:14,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:01:14,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:01:14,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:01:14,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:01:14,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:01:14,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:01:14,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:01:14,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:01:14,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:01:14,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:01:14,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:01:14,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:01:14,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:01:14,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:01:14,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:01:14,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:01:14,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:01:14,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:01:14,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:01:14,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:01:14,031 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:01:14,031 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:01:14,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:01:14,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:01:14,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:01:14,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:01:14,032 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-09 02:01:14,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:01:14,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:01:14,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:01:14,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:01:14,363 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:01:14,364 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-09 02:01:15,906 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:01:16,126 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:01:16,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-22.i [2024-11-09 02:01:16,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8812bd63/bbff6efbf53543dc90514dc12723ba6b/FLAG7fd502df4 [2024-11-09 02:01:16,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8812bd63/bbff6efbf53543dc90514dc12723ba6b [2024-11-09 02:01:16,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:01:16,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:01:16,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:01:16,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:01:16,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:01:16,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737c784c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16, skipping insertion in model container [2024-11-09 02:01:16,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:01:16,372 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-09 02:01:16,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:01:16,469 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:01:16,501 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-09 02:01:16,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:01:16,582 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:01:16,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16 WrapperNode [2024-11-09 02:01:16,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:01:16,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:01:16,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:01:16,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:01:16,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,658 INFO L138 Inliner]: procedures = 37, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 393 [2024-11-09 02:01:16,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:01:16,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:01:16,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:01:16,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:01:16,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,713 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-09 02:01:16,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:01:16,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:01:16,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:01:16,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:01:16,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (1/1) ... [2024-11-09 02:01:16,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:01:16,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:01:16,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:01:16,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:01:16,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:01:16,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:01:16,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:01:16,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:01:16,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:01:16,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 02:01:16,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 02:01:16,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 02:01:16,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 02:01:16,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 02:01:16,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 02:01:16,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-09 02:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-09 02:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 02:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 02:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-09 02:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-09 02:01:16,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:01:16,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:01:16,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:01:16,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:01:16,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 02:01:16,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 02:01:16,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:01:16,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:01:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:01:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:01:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 02:01:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 02:01:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 02:01:16,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 02:01:16,984 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:01:16,986 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:01:18,567 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-09 02:01:18,568 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:01:18,586 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:01:18,588 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:01:18,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:01:18 BoogieIcfgContainer [2024-11-09 02:01:18,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:01:18,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:01:18,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:01:18,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:01:18,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:01:16" (1/3) ... [2024-11-09 02:01:18,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3962f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:01:18, skipping insertion in model container [2024-11-09 02:01:18,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:01:16" (2/3) ... [2024-11-09 02:01:18,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3962f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:01:18, skipping insertion in model container [2024-11-09 02:01:18,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:01:18" (3/3) ... [2024-11-09 02:01:18,596 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-22.i [2024-11-09 02:01:18,613 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:01:18,613 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:01:18,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:01:18,701 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;@43f25304, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:01:18,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:01:18,707 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-09 02:01:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 02:01:18,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:18,717 INFO L215 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-09 02:01:18,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:18,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:18,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1037497833, now seen corresponding path program 1 times [2024-11-09 02:01:18,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:01:18,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891726712] [2024-11-09 02:01:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:18,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:01:18,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:01:18,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:01:18,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 02:01:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:19,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:01:19,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:19,139 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-09 02:01:19,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:01:19,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:01:19,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891726712] [2024-11-09 02:01:19,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891726712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:19,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:19,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:01:19,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317599192] [2024-11-09 02:01:19,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:19,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:01:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:01:19,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:01:19,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:01:19,176 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-09 02:01:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:19,213 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2024-11-09 02:01:19,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:01:19,218 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-09 02:01:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:19,227 INFO L225 Difference]: With dead ends: 188 [2024-11-09 02:01:19,228 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 02:01:19,231 INFO L431 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-09 02:01:19,234 INFO L432 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-09 02:01:19,235 INFO L433 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-09 02:01:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 02:01:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 02:01:19,282 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-09 02:01:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-11-09 02:01:19,288 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 89 [2024-11-09 02:01:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:19,288 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-11-09 02:01:19,289 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-09 02:01:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-11-09 02:01:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 02:01:19,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:19,294 INFO L215 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-09 02:01:19,309 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-09 02:01:19,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:01:19,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:19,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:19,496 INFO L85 PathProgramCache]: Analyzing trace with hash -8583379, now seen corresponding path program 1 times [2024-11-09 02:01:19,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:01:19,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540641827] [2024-11-09 02:01:19,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:19,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:01:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:01:19,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:01:19,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 02:01:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:19,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:01:19,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:19,927 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-09 02:01:19,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:01:19,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:01:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540641827] [2024-11-09 02:01:19,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540641827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:19,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:19,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:01:19,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254805832] [2024-11-09 02:01:19,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:19,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:01:19,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:01:19,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:01:19,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:01:19,936 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-09 02:01:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:20,014 INFO L93 Difference]: Finished difference Result 183 states and 258 transitions. [2024-11-09 02:01:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:01:20,015 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-09 02:01:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:20,017 INFO L225 Difference]: With dead ends: 183 [2024-11-09 02:01:20,019 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 02:01:20,020 INFO L431 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-09 02:01:20,021 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:20,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:01:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 02:01:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 02:01:20,037 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-09 02:01:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2024-11-09 02:01:20,039 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 92 [2024-11-09 02:01:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:20,040 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2024-11-09 02:01:20,041 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-09 02:01:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2024-11-09 02:01:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 02:01:20,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:20,044 INFO L215 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-09 02:01:20,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 02:01:20,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:01:20,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:20,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash -902069717, now seen corresponding path program 1 times [2024-11-09 02:01:20,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:01:20,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082470171] [2024-11-09 02:01:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:20,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:01:20,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:01:20,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:01:20,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 02:01:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:20,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 02:01:20,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:20,829 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-09 02:01:20,999 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-09 02:01:21,225 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-09 02:01:21,272 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-09 02:01:21,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:21,398 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-09 02:01:21,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:21,442 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-09 02:01:21,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:21,495 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-09 02:01:21,576 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-09 02:01:21,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:01:21,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:01:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082470171] [2024-11-09 02:01:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082470171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:01:21,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818051744] [2024-11-09 02:01:21,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:21,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:01:21,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:01:21,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:01:21,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:01:21,580 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-09 02:01:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:28,111 INFO L93 Difference]: Finished difference Result 552 states and 771 transitions. [2024-11-09 02:01:28,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:01:28,112 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-09 02:01:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:28,116 INFO L225 Difference]: With dead ends: 552 [2024-11-09 02:01:28,116 INFO L226 Difference]: Without dead ends: 461 [2024-11-09 02:01:28,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:01:28,119 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 552 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.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, 6.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:28,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1000 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-09 02:01:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-09 02:01:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 313. [2024-11-09 02:01:28,166 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-09 02:01:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 442 transitions. [2024-11-09 02:01:28,173 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 442 transitions. Word has length 92 [2024-11-09 02:01:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:28,174 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 442 transitions. [2024-11-09 02:01:28,174 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-09 02:01:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 442 transitions. [2024-11-09 02:01:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 02:01:28,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:28,180 INFO L215 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-09 02:01:28,192 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-09 02:01:28,381 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-09 02:01:28,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:28,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash 278484247, now seen corresponding path program 1 times [2024-11-09 02:01:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:01:28,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007031663] [2024-11-09 02:01:28,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:28,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:01:28,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:01:28,387 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-09 02:01:28,389 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-09 02:01:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:28,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:01:28,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:28,745 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-09 02:01:28,777 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-09 02:01:28,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:01:28,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:01:28,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007031663] [2024-11-09 02:01:28,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007031663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:28,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:28,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:01:28,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183416262] [2024-11-09 02:01:28,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:28,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:01:28,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:01:28,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:01:28,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:01:28,783 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-09 02:01:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:28,824 INFO L93 Difference]: Finished difference Result 493 states and 695 transitions. [2024-11-09 02:01:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:01:28,825 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-09 02:01:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:28,827 INFO L225 Difference]: With dead ends: 493 [2024-11-09 02:01:28,827 INFO L226 Difference]: Without dead ends: 226 [2024-11-09 02:01:28,829 INFO L431 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-09 02:01:28,831 INFO L432 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-09 02:01:28,832 INFO L433 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-09 02:01:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-09 02:01:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2024-11-09 02:01:28,853 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-09 02:01:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 312 transitions. [2024-11-09 02:01:28,855 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 312 transitions. Word has length 93 [2024-11-09 02:01:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:28,856 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 312 transitions. [2024-11-09 02:01:28,856 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-09 02:01:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 312 transitions. [2024-11-09 02:01:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 02:01:28,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:28,859 INFO L215 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-09 02:01:28,869 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-09 02:01:29,059 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-09 02:01:29,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:29,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1801465933, now seen corresponding path program 1 times [2024-11-09 02:01:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:01:29,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302034048] [2024-11-09 02:01:29,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:29,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:01:29,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:01:29,064 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-09 02:01:29,066 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-09 02:01:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:29,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 02:01:29,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:29,378 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-09 02:01:29,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:01:29,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:01:29,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302034048] [2024-11-09 02:01:29,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302034048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:29,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:29,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:01:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484582690] [2024-11-09 02:01:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:29,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:01:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:01:29,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:01:29,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:01:29,380 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-09 02:01:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:29,545 INFO L93 Difference]: Finished difference Result 415 states and 577 transitions. [2024-11-09 02:01:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:01:29,546 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-09 02:01:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:29,548 INFO L225 Difference]: With dead ends: 415 [2024-11-09 02:01:29,548 INFO L226 Difference]: Without dead ends: 237 [2024-11-09 02:01:29,549 INFO L431 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-09 02:01:29,550 INFO L432 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-09 02:01:29,550 INFO L433 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-09 02:01:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-09 02:01:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 152. [2024-11-09 02:01:29,558 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-09 02:01:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 209 transitions. [2024-11-09 02:01:29,563 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 209 transitions. Word has length 93 [2024-11-09 02:01:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:29,563 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 209 transitions. [2024-11-09 02:01:29,563 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-09 02:01:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 209 transitions. [2024-11-09 02:01:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 02:01:29,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:29,565 INFO L215 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-09 02:01:29,583 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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 02:01:29,768 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-09 02:01:29,769 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:29,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:29,769 INFO L85 PathProgramCache]: Analyzing trace with hash -498818970, now seen corresponding path program 1 times [2024-11-09 02:01:29,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:01:29,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261941057] [2024-11-09 02:01:29,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:29,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:01:29,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:01:29,771 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-09 02:01:29,772 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-09 02:01:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:30,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 02:01:30,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:30,300 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-09 02:01:30,417 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-09 02:01:30,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 14 treesize of output 10 [2024-11-09 02:01:30,649 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-09 02:01:30,706 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-09 02:01:30,728 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-09 02:01:30,780 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-09 02:01:30,892 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-09 02:01:30,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:01:30,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:01:30,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261941057] [2024-11-09 02:01:30,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261941057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:30,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:30,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:01:30,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041658432] [2024-11-09 02:01:30,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:30,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:01:30,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:01:30,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:01:30,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:01:30,895 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-09 02:01:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:33,679 INFO L93 Difference]: Finished difference Result 324 states and 442 transitions. [2024-11-09 02:01:33,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:01:33,679 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-09 02:01:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:33,681 INFO L225 Difference]: With dead ends: 324 [2024-11-09 02:01:33,681 INFO L226 Difference]: Without dead ends: 234 [2024-11-09 02:01:33,682 INFO L431 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-09 02:01:33,683 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 177 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:01:33,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 580 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 02:01:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-09 02:01:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 160. [2024-11-09 02:01:33,691 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-09 02:01:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 220 transitions. [2024-11-09 02:01:33,692 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 220 transitions. Word has length 94 [2024-11-09 02:01:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:33,693 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 220 transitions. [2024-11-09 02:01:33,693 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-09 02:01:33,693 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 220 transitions. [2024-11-09 02:01:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 02:01:33,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:33,694 INFO L215 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-09 02:01:33,707 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-09 02:01:33,898 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-09 02:01:33,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:33,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:33,899 INFO L85 PathProgramCache]: Analyzing trace with hash 393840305, now seen corresponding path program 1 times [2024-11-09 02:01:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:01:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228667618] [2024-11-09 02:01:33,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:33,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:01:33,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:01:33,901 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-09 02:01:33,903 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-09 02:01:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:34,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:01:34,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:34,219 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-09 02:01:34,237 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-09 02:01:34,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:01:34,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:01:34,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228667618] [2024-11-09 02:01:34,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228667618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:01:34,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:01:34,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:01:34,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752050770] [2024-11-09 02:01:34,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:01:34,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:01:34,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:01:34,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:01:34,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:01:34,240 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-09 02:01:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:01:34,261 INFO L93 Difference]: Finished difference Result 252 states and 346 transitions. [2024-11-09 02:01:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:01:34,261 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-09 02:01:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:01:34,263 INFO L225 Difference]: With dead ends: 252 [2024-11-09 02:01:34,263 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 02:01:34,263 INFO L431 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-09 02:01:34,264 INFO L432 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-09 02:01:34,264 INFO L433 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-09 02:01:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 02:01:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-09 02:01:34,270 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-09 02:01:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 209 transitions. [2024-11-09 02:01:34,272 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 209 transitions. Word has length 94 [2024-11-09 02:01:34,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:01:34,272 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 209 transitions. [2024-11-09 02:01:34,272 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-09 02:01:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 209 transitions. [2024-11-09 02:01:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 02:01:34,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:01:34,273 INFO L215 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-09 02:01:34,287 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-09 02:01:34,474 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-09 02:01:34,474 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:01:34,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:01:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1228323282, now seen corresponding path program 1 times [2024-11-09 02:01:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:01:34,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892092918] [2024-11-09 02:01:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:34,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:01:34,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:01:34,477 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-09 02:01:34,477 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-09 02:01:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:34,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 02:01:34,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:34,895 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-09 02:01:34,918 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-09 02:01:34,967 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-09 02:01:35,116 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-09 02:01:35,197 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-09 02:01:35,279 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-09 02:01:35,360 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-09 02:01:35,479 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-09 02:01:35,523 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-09 02:01:35,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:01:35,855 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-09 02:01:35,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:01:35,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892092918] [2024-11-09 02:01:35,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892092918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:01:35,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [556424886] [2024-11-09 02:01:35,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:01:35,925 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 02:01:35,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 02:01:35,928 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-09 02:01:35,929 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-09 02:01:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:01:36,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 02:01:36,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:01:36,949 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-09 02:01:37,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:01:37,009 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-09 02:01:37,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 12 treesize of output 8 [2024-11-09 02:01:37,613 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-09 02:01:37,751 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-09 02:01:37,864 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-09 02:01:38,011 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-09 02:01:38,220 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-09 02:01:38,251 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-09 02:01:38,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:01:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [556424886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:01:38,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:01:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-11-09 02:01:38,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151438087] [2024-11-09 02:01:38,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 02:01:38,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 02:01:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:01:38,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 02:01:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-11-09 02:01:38,425 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)