./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.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-sp_file-63.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 d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:15:37,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:15:37,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:15:37,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:15:37,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:15:37,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:15:37,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:15:37,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:15:37,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:15:37,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:15:37,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:15:37,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:15:37,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:15:37,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:15:37,650 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:15:37,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:15:37,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:15:37,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:15:37,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:15:37,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:15:37,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:15:37,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:15:37,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:15:37,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:15:37,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:15:37,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:15:37,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:15:37,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:15:37,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:15:37,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:15:37,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:15:37,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:15:37,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:15:37,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:15:37,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:15:37,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:15:37,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:15:37,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:15:37,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:15:37,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:15:37,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:15:37,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:15:37,660 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 -> d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e [2024-11-09 02:15:37,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:15:37,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:15:37,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:15:37,891 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:15:37,891 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:15:37,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2024-11-09 02:15:39,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:15:39,550 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:15:39,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2024-11-09 02:15:39,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a68ae698/9b7610bca651472bbd522f769ca5c2fd/FLAG61828f5b8 [2024-11-09 02:15:39,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a68ae698/9b7610bca651472bbd522f769ca5c2fd [2024-11-09 02:15:39,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:15:39,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:15:39,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:39,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:15:39,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:15:39,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:39" (1/1) ... [2024-11-09 02:15:39,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a016e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:39, skipping insertion in model container [2024-11-09 02:15:39,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:39" (1/1) ... [2024-11-09 02:15:39,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:15:40,182 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-sp_file-63.i[917,930] [2024-11-09 02:15:40,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:40,274 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:15:40,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i[917,930] [2024-11-09 02:15:40,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:40,347 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:15:40,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40 WrapperNode [2024-11-09 02:15:40,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:40,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:40,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:15:40,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:15:40,355 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:15:40" (1/1) ... [2024-11-09 02:15:40,366 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:15:40" (1/1) ... [2024-11-09 02:15:40,401 INFO L138 Inliner]: procedures = 30, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 679 [2024-11-09 02:15:40,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:40,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:15:40,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:15:40,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:15:40,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40" (1/1) ... [2024-11-09 02:15:40,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40" (1/1) ... [2024-11-09 02:15:40,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40" (1/1) ... [2024-11-09 02:15:40,428 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:15:40,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40" (1/1) ... [2024-11-09 02:15:40,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40" (1/1) ... [2024-11-09 02:15:40,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40" (1/1) ... [2024-11-09 02:15:40,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40" (1/1) ... [2024-11-09 02:15:40,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40" (1/1) ... [2024-11-09 02:15:40,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40" (1/1) ... [2024-11-09 02:15:40,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:15:40,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:15:40,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:15:40,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:15:40,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40" (1/1) ... [2024-11-09 02:15:40,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:15:40,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:15:40,504 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:15:40,508 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:15:40,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:15:40,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:15:40,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:15:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:15:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:15:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:15:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:15:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:15:40,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:15:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:15:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:15:40,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:15:40,796 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:15:40,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:15:41,398 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2024-11-09 02:15:41,398 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:15:41,413 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:15:41,414 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:15:41,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:15:41 BoogieIcfgContainer [2024-11-09 02:15:41,415 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:15:41,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:15:41,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:15:41,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:15:41,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:15:39" (1/3) ... [2024-11-09 02:15:41,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587114c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:15:41, skipping insertion in model container [2024-11-09 02:15:41,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:40" (2/3) ... [2024-11-09 02:15:41,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587114c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:15:41, skipping insertion in model container [2024-11-09 02:15:41,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:15:41" (3/3) ... [2024-11-09 02:15:41,424 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-63.i [2024-11-09 02:15:41,437 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:15:41,437 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:15:41,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:15:41,487 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;@62b5d097, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:15:41,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:15:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:15:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 02:15:41,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:41,505 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:41,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:41,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash 79458764, now seen corresponding path program 1 times [2024-11-09 02:15:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:41,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073406852] [2024-11-09 02:15:41,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:41,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:15:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:15:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:15:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:15:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:15:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:15:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:15:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:15:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:15:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073406852] [2024-11-09 02:15:41,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073406852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:41,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:41,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:15:41,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612645167] [2024-11-09 02:15:41,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:41,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:15:42,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:42,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:15:42,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:15:42,027 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 02:15:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:42,080 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-09 02:15:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:15:42,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-09 02:15:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:42,093 INFO L225 Difference]: With dead ends: 271 [2024-11-09 02:15:42,093 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 02:15:42,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:15:42,099 INFO L432 NwaCegarLoop]: 198 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, 198 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:15:42,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 02:15:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 02:15:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:15:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-09 02:15:42,150 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-09 02:15:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:42,151 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-09 02:15:42,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 02:15:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-09 02:15:42,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 02:15:42,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:42,159 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:42,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:15:42,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:42,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash 509231968, now seen corresponding path program 1 times [2024-11-09 02:15:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:42,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669356039] [2024-11-09 02:15:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:15:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:15:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:15:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:15:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:15:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:15:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:15:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:15:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:15:42,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:42,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669356039] [2024-11-09 02:15:42,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669356039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:42,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:42,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:15:42,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635066719] [2024-11-09 02:15:42,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:42,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:15:42,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:42,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:15:42,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:42,499 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 02:15:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:42,556 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-09 02:15:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:15:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-09 02:15:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:42,563 INFO L225 Difference]: With dead ends: 269 [2024-11-09 02:15:42,563 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 02:15:42,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:15:42,565 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:42,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 02:15:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-09 02:15:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:15:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-09 02:15:42,576 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-09 02:15:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:42,577 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-09 02:15:42,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 02:15:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-09 02:15:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 02:15:42,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:42,579 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:42,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:15:42,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:42,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:42,580 INFO L85 PathProgramCache]: Analyzing trace with hash 145765470, now seen corresponding path program 1 times [2024-11-09 02:15:42,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:42,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891553873] [2024-11-09 02:15:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:15:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:15:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:15:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:15:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:15:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:15:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:15:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:15:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:15:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891553873] [2024-11-09 02:15:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891553873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:42,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:15:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152867058] [2024-11-09 02:15:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:42,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:15:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:15:42,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:42,909 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:15:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:42,930 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2024-11-09 02:15:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:15:42,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-09 02:15:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:42,932 INFO L225 Difference]: With dead ends: 273 [2024-11-09 02:15:42,932 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 02:15:42,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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:15:42,934 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:42,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 02:15:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-09 02:15:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:15:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-09 02:15:42,942 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2024-11-09 02:15:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:42,943 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-09 02:15:42,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:15:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-09 02:15:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:15:42,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:42,949 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:42,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:15:42,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:42,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1498114201, now seen corresponding path program 1 times [2024-11-09 02:15:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111574688] [2024-11-09 02:15:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:15:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:15:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:15:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:15:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:15:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:15:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:15:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:15:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:15:43,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111574688] [2024-11-09 02:15:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111574688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:43,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:43,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:15:43,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450598405] [2024-11-09 02:15:43,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:43,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:15:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:43,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:15:43,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:43,219 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:15:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:43,260 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2024-11-09 02:15:43,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:15:43,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 02:15:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:43,262 INFO L225 Difference]: With dead ends: 278 [2024-11-09 02:15:43,262 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 02:15:43,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:15:43,263 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:43,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 02:15:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-09 02:15:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:15:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-09 02:15:43,283 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 158 [2024-11-09 02:15:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:43,284 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-09 02:15:43,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:15:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-09 02:15:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:15:43,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:43,286 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:43,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:15:43,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:43,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash 911308187, now seen corresponding path program 1 times [2024-11-09 02:15:43,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:43,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504782641] [2024-11-09 02:15:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:43,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:15:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:15:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:15:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:15:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:15:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:15:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:15:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:15:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:15:43,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:43,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504782641] [2024-11-09 02:15:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504782641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:43,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:15:43,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089973485] [2024-11-09 02:15:43,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:43,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:15:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:15:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:43,521 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:15:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:43,555 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2024-11-09 02:15:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:15:43,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 02:15:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:43,559 INFO L225 Difference]: With dead ends: 282 [2024-11-09 02:15:43,560 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 02:15:43,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:15:43,562 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:43,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 02:15:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-09 02:15:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:15:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-09 02:15:43,593 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2024-11-09 02:15:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:43,594 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-09 02:15:43,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:15:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-09 02:15:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:15:43,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:43,600 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:43,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:15:43,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:43,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:43,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1591366557, now seen corresponding path program 1 times [2024-11-09 02:15:43,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:43,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290061850] [2024-11-09 02:15:43,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:15:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:15:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:15:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:15:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:15:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:15:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:15:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:15:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:15:43,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290061850] [2024-11-09 02:15:43,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290061850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:43,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:43,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:15:43,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189671491] [2024-11-09 02:15:43,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:43,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:15:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:43,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:15:43,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:43,842 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:15:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:43,861 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2024-11-09 02:15:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:15:43,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 02:15:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:43,863 INFO L225 Difference]: With dead ends: 286 [2024-11-09 02:15:43,863 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 02:15:43,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:15:43,864 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:43,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 02:15:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-09 02:15:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:15:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2024-11-09 02:15:43,870 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 158 [2024-11-09 02:15:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:43,870 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2024-11-09 02:15:43,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:15:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2024-11-09 02:15:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:15:43,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:43,872 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:43,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:15:43,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:43,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:43,872 INFO L85 PathProgramCache]: Analyzing trace with hash -928593377, now seen corresponding path program 1 times [2024-11-09 02:15:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495786875] [2024-11-09 02:15:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:15:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:15:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:15:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:15:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:15:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:15:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:15:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:15:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:15:44,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:44,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495786875] [2024-11-09 02:15:44,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495786875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:44,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:44,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:15:44,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669475795] [2024-11-09 02:15:44,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:44,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:15:44,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:44,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:15:44,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:44,030 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:15:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:44,047 INFO L93 Difference]: Finished difference Result 290 states and 417 transitions. [2024-11-09 02:15:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:15:44,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 02:15:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:44,049 INFO L225 Difference]: With dead ends: 290 [2024-11-09 02:15:44,049 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 02:15:44,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:15:44,050 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:44,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 02:15:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-09 02:15:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:15:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2024-11-09 02:15:44,055 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 158 [2024-11-09 02:15:44,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:44,055 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2024-11-09 02:15:44,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:15:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2024-11-09 02:15:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:15:44,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:44,057 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:44,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:15:44,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:44,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:44,057 INFO L85 PathProgramCache]: Analyzing trace with hash -926746335, now seen corresponding path program 1 times [2024-11-09 02:15:44,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:44,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413320698] [2024-11-09 02:15:44,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:44,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:15:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:15:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:15:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:15:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:15:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:15:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:15:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:15:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:15:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 02:15:46,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:46,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413320698] [2024-11-09 02:15:46,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413320698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:15:46,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677599379] [2024-11-09 02:15:46,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:46,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:15:46,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:15:46,820 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:15:46,823 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:15:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:47,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 02:15:47,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:15:48,463 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 15 treesize of output 1 [2024-11-09 02:15:49,306 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 25 treesize of output 13 [2024-11-09 02:15:49,722 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 25 treesize of output 13 [2024-11-09 02:15:50,289 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 25 treesize of output 13 [2024-11-09 02:15:50,816 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 25 treesize of output 13 [2024-11-09 02:15:51,304 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 25 treesize of output 13 [2024-11-09 02:15:51,685 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 25 treesize of output 13 [2024-11-09 02:15:52,104 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 25 treesize of output 13 [2024-11-09 02:15:52,572 INFO L349 Elim1Store]: treesize reduction 346, result has 9.2 percent of original size [2024-11-09 02:15:52,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 592 treesize of output 352 [2024-11-09 02:15:52,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 61 treesize of output 51 [2024-11-09 02:15:52,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 61 treesize of output 51 [2024-11-09 02:15:53,320 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-09 02:15:53,320 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 2 case distinctions, treesize of input 535 treesize of output 532 [2024-11-09 02:15:53,461 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-09 02:15:53,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 02:15:53,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:15:53,667 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 02:15:53,671 INFO L158 Benchmark]: Toolchain (without parser) took 13737.79ms. Allocated memory was 226.5MB in the beginning and 765.5MB in the end (delta: 539.0MB). Free memory was 157.1MB in the beginning and 646.8MB in the end (delta: -489.6MB). Peak memory consumption was 297.0MB. Max. memory is 16.1GB. [2024-11-09 02:15:53,671 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:15:53,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.01ms. Allocated memory is still 226.5MB. Free memory was 157.1MB in the beginning and 137.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 02:15:53,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.83ms. Allocated memory is still 226.5MB. Free memory was 137.8MB in the beginning and 133.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:15:53,672 INFO L158 Benchmark]: Boogie Preprocessor took 54.71ms. Allocated memory is still 226.5MB. Free memory was 133.7MB in the beginning and 129.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:15:53,672 INFO L158 Benchmark]: RCFGBuilder took 955.20ms. Allocated memory is still 226.5MB. Free memory was 129.9MB in the beginning and 154.2MB in the end (delta: -24.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 02:15:53,672 INFO L158 Benchmark]: TraceAbstraction took 12253.91ms. Allocated memory was 226.5MB in the beginning and 765.5MB in the end (delta: 539.0MB). Free memory was 153.2MB in the beginning and 646.8MB in the end (delta: -493.6MB). Peak memory consumption was 292.8MB. Max. memory is 16.1GB. [2024-11-09 02:15:53,676 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.14ms. Allocated memory is still 121.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.01ms. Allocated memory is still 226.5MB. Free memory was 157.1MB in the beginning and 137.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.83ms. Allocated memory is still 226.5MB. Free memory was 137.8MB in the beginning and 133.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.71ms. Allocated memory is still 226.5MB. Free memory was 133.7MB in the beginning and 129.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 955.20ms. Allocated memory is still 226.5MB. Free memory was 129.9MB in the beginning and 154.2MB in the end (delta: -24.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12253.91ms. Allocated memory was 226.5MB in the beginning and 765.5MB in the end (delta: 539.0MB). Free memory was 153.2MB in the beginning and 646.8MB in the end (delta: -493.6MB). Peak memory consumption was 292.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-09 02:15:53,701 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-sp_file-63.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 d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:15:55,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:15:56,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:15:56,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:15:56,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:15:56,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:15:56,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:15:56,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:15:56,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:15:56,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:15:56,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:15:56,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:15:56,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:15:56,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:15:56,048 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:15:56,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:15:56,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:15:56,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:15:56,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:15:56,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:15:56,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:15:56,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:15:56,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:15:56,051 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:15:56,051 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:15:56,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:15:56,052 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:15:56,052 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:15:56,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:15:56,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:15:56,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:15:56,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:15:56,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:15:56,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:15:56,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:15:56,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:15:56,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:15:56,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:15:56,053 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:15:56,053 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:15:56,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:15:56,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:15:56,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:15:56,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:15:56,056 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 -> d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e [2024-11-09 02:15:56,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:15:56,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:15:56,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:15:56,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:15:56,355 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:15:56,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2024-11-09 02:15:57,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:15:57,986 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:15:57,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2024-11-09 02:15:58,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deede187d/f6e2060a6c9c41a2ac036afb4a39e120/FLAGe3a314302 [2024-11-09 02:15:58,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deede187d/f6e2060a6c9c41a2ac036afb4a39e120 [2024-11-09 02:15:58,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:15:58,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:15:58,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:58,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:15:58,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:15:58,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57631b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58, skipping insertion in model container [2024-11-09 02:15:58,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:15:58,547 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-sp_file-63.i[917,930] [2024-11-09 02:15:58,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:58,656 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:15:58,667 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-sp_file-63.i[917,930] [2024-11-09 02:15:58,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:58,728 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:15:58,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58 WrapperNode [2024-11-09 02:15:58,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:58,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:58,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:15:58,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:15:58,735 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:15:58" (1/1) ... [2024-11-09 02:15:58,760 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:15:58" (1/1) ... [2024-11-09 02:15:58,794 INFO L138 Inliner]: procedures = 37, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 673 [2024-11-09 02:15:58,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:58,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:15:58,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:15:58,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:15:58,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,835 INFO L175 MemorySlicer]: Split 175 memory accesses to 2 slices as follows [2, 173]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 38 writes are split as follows [0, 38]. [2024-11-09 02:15:58,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,851 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:15:58,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:15:58,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:15:58,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:15:58,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58" (1/1) ... [2024-11-09 02:15:58,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:15:58,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:15:58,917 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:15:58,931 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:15:58,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:15:58,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:15:58,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:15:58,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:15:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:15:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 02:15:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 02:15:58,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 02:15:58,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 02:15:58,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 02:15:58,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 02:15:58,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-09 02:15:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-09 02:15:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 02:15:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 02:15:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-09 02:15:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-09 02:15:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:15:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:15:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:15:58,995 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:15:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 02:15:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 02:15:58,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:15:58,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:15:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:15:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:15:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 02:15:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 02:15:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 02:15:58,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 02:15:59,183 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:15:59,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:16:02,893 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-09 02:16:02,893 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:16:02,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:16:02,914 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:16:02,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:16:02 BoogieIcfgContainer [2024-11-09 02:16:02,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:16:02,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:16:02,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:16:02,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:16:02,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:15:58" (1/3) ... [2024-11-09 02:16:02,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564d5d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:16:02, skipping insertion in model container [2024-11-09 02:16:02,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:58" (2/3) ... [2024-11-09 02:16:02,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564d5d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:16:02, skipping insertion in model container [2024-11-09 02:16:02,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:16:02" (3/3) ... [2024-11-09 02:16:02,922 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-63.i [2024-11-09 02:16:02,934 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:16:02,935 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:16:02,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:16:02,985 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;@247ee0ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:16:02,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:16:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:16:02,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 02:16:02,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:03,000 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:03,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:03,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:03,004 INFO L85 PathProgramCache]: Analyzing trace with hash -16098142, now seen corresponding path program 1 times [2024-11-09 02:16:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:03,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624623976] [2024-11-09 02:16:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:03,016 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:16:03,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:03,019 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:16:03,039 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:16:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:03,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:16:03,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-09 02:16:03,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:03,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:03,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624623976] [2024-11-09 02:16:03,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624623976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:03,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:03,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:16:03,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536542296] [2024-11-09 02:16:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:03,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:16:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:03,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:16:03,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:16:03,690 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 02:16:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:03,721 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-09 02:16:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:16:03,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-09 02:16:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:03,730 INFO L225 Difference]: With dead ends: 271 [2024-11-09 02:16:03,731 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 02:16:03,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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:16:03,736 INFO L432 NwaCegarLoop]: 198 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, 198 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:16:03,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:16:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 02:16:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 02:16:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:16:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-09 02:16:03,775 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-09 02:16:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:03,776 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-09 02:16:03,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 02:16:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-09 02:16:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 02:16:03,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:03,779 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:03,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 02:16:03,983 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:16:03,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:03,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash 413675062, now seen corresponding path program 1 times [2024-11-09 02:16:03,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:03,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374691873] [2024-11-09 02:16:03,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:03,991 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:16:03,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:03,993 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:16:03,998 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:16:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:04,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:16:04,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:16:04,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:04,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374691873] [2024-11-09 02:16:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374691873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:04,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:04,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:16:04,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932288821] [2024-11-09 02:16:04,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:04,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:16:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:04,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:16:04,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:16:04,679 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:16:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:04,728 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-09 02:16:04,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:16:04,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-09 02:16:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:04,730 INFO L225 Difference]: With dead ends: 269 [2024-11-09 02:16:04,730 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 02:16:04,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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:16:04,732 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:04,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:16:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 02:16:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-09 02:16:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:16:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-09 02:16:04,742 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-09 02:16:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:04,744 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-09 02:16:04,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:16:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-09 02:16:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:16:04,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:04,746 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:04,759 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:16:04,950 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:16:04,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:04,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:04,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1261194609, now seen corresponding path program 1 times [2024-11-09 02:16:04,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:04,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006925192] [2024-11-09 02:16:04,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:04,953 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:16:04,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:04,957 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:16:04,960 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:16:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:05,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:16:05,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:16:05,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:05,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:05,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006925192] [2024-11-09 02:16:05,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006925192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:05,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:05,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:16:05,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273066218] [2024-11-09 02:16:05,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:05,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:16:05,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:05,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:16:05,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:16:05,711 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:16:05,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:05,757 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2024-11-09 02:16:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:16:05,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 02:16:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:05,761 INFO L225 Difference]: With dead ends: 274 [2024-11-09 02:16:05,764 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 02:16:05,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 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:16:05,766 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:05,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:16:05,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 02:16:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-11-09 02:16:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:16:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-09 02:16:05,783 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 158 [2024-11-09 02:16:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:05,784 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-09 02:16:05,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:16:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-09 02:16:05,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:16:05,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:05,791 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:05,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 02:16:05,992 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:16:05,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:05,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash 674388595, now seen corresponding path program 1 times [2024-11-09 02:16:05,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:05,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594395989] [2024-11-09 02:16:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:05,997 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:16:05,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:06,003 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:16:06,006 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:16:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:06,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 02:16:06,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:16:06,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:06,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:06,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594395989] [2024-11-09 02:16:06,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594395989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:06,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:06,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:16:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791906041] [2024-11-09 02:16:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:06,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:16:06,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:06,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:16:06,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:16:06,533 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:16:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:06,582 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2024-11-09 02:16:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:16:06,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 02:16:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:06,584 INFO L225 Difference]: With dead ends: 280 [2024-11-09 02:16:06,584 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 02:16:06,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:16:06,585 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:06,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 935 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:16:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 02:16:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-09 02:16:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:16:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-09 02:16:06,593 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2024-11-09 02:16:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:06,593 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-09 02:16:06,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:16:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-09 02:16:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:16:06,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:06,595 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:06,608 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:16:06,795 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:16:06,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:06,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1354446965, now seen corresponding path program 1 times [2024-11-09 02:16:06,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:06,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311331693] [2024-11-09 02:16:06,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:06,798 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:16:06,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:06,801 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:16:06,802 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:16:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:07,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 02:16:07,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:16:07,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:07,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:07,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311331693] [2024-11-09 02:16:07,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311331693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:07,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:07,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:16:07,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908940002] [2024-11-09 02:16:07,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:07,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:16:07,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:16:07,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:16:07,342 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:16:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:07,405 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2024-11-09 02:16:07,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:16:07,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 02:16:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:07,406 INFO L225 Difference]: With dead ends: 286 [2024-11-09 02:16:07,407 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 02:16:07,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:16:07,408 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:07,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1110 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:16:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 02:16:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-09 02:16:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:16:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2024-11-09 02:16:07,415 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 158 [2024-11-09 02:16:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:07,415 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2024-11-09 02:16:07,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:16:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2024-11-09 02:16:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:16:07,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:07,417 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:07,431 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:16:07,617 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:16:07,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:07,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1165512969, now seen corresponding path program 1 times [2024-11-09 02:16:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:07,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002102272] [2024-11-09 02:16:07,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:07,618 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:16:07,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:07,622 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:16:07,623 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:16:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:08,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 02:16:08,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:16:08,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:16:08,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:16:08,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002102272] [2024-11-09 02:16:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002102272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:08,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:08,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:16:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449500749] [2024-11-09 02:16:08,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:08,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:16:08,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:16:08,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:16:08,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:16:08,394 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:16:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:08,534 INFO L93 Difference]: Finished difference Result 290 states and 417 transitions. [2024-11-09 02:16:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:16:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-09 02:16:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:08,540 INFO L225 Difference]: With dead ends: 290 [2024-11-09 02:16:08,540 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 02:16:08,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:16:08,542 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:08,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1287 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:16:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 02:16:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-09 02:16:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:16:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2024-11-09 02:16:08,555 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 158 [2024-11-09 02:16:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:08,559 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2024-11-09 02:16:08,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 02:16:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2024-11-09 02:16:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 02:16:08,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:08,561 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:08,580 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:16:08,764 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:16:08,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:08,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:08,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1163665927, now seen corresponding path program 1 times [2024-11-09 02:16:08,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:16:08,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053966521] [2024-11-09 02:16:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:08,767 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:16:08,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:16:08,769 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:16:08,773 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:16:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:09,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 02:16:09,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:11,648 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:16:12,595 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 25 treesize of output 13 [2024-11-09 02:16:13,205 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 25 treesize of output 13 [2024-11-09 02:16:13,945 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 22 treesize of output 21 [2024-11-09 02:16:14,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-09 02:16:15,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-09 02:16:16,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2024-11-09 02:16:17,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-09 02:16:18,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 02:16:18,454 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 02:16:18,691 INFO L349 Elim1Store]: treesize reduction 63, result has 22.2 percent of original size [2024-11-09 02:16:18,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 139 treesize of output 111 [2024-11-09 02:16:18,772 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-09 02:16:18,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 72 [2024-11-09 02:16:19,096 INFO L349 Elim1Store]: treesize reduction 275, result has 6.1 percent of original size [2024-11-09 02:16:19,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 6 select indices, 6 select index equivalence classes, 36 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 172 treesize of output 318 [2024-11-09 02:16:20,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 85 [2024-11-09 02:16:20,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 85 [2024-11-09 02:16:20,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 63 [2024-11-09 02:16:20,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 63 [2024-11-09 02:16:21,736 INFO L349 Elim1Store]: treesize reduction 535, result has 7.3 percent of original size [2024-11-09 02:16:21,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 17 case distinctions, treesize of input 322 treesize of output 393 [2024-11-09 02:16:22,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 70 [2024-11-09 02:16:22,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 85 [2024-11-09 02:16:23,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 70 [2024-11-09 02:16:23,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 85 [2024-11-09 02:16:27,611 INFO L349 Elim1Store]: treesize reduction 165, result has 34.3 percent of original size [2024-11-09 02:16:27,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 778 treesize of output 668 [2024-11-09 02:16:54,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 101 [2024-11-09 02:16:55,460 INFO L349 Elim1Store]: treesize reduction 71, result has 13.4 percent of original size [2024-11-09 02:16:55,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 47 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 8 case distinctions, treesize of input 77 treesize of output 126 [2024-11-09 02:16:57,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 119 [2024-11-09 02:16:59,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 108 [2024-11-09 02:17:00,184 INFO L349 Elim1Store]: treesize reduction 172, result has 15.3 percent of original size [2024-11-09 02:17:00,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 199 treesize of output 259 [2024-11-09 02:17:00,761 INFO L349 Elim1Store]: treesize reduction 71, result has 13.4 percent of original size [2024-11-09 02:17:00,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 38 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 68 treesize of output 112 [2024-11-09 02:17:00,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2024-11-09 02:17:01,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 116 [2024-11-09 02:17:04,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 115