./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.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 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:05:39,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:05:40,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:05:40,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:05:40,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:05:40,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:05:40,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:05:40,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:05:40,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:05:40,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:05:40,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:05:40,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:05:40,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:05:40,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:05:40,116 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:05:40,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:05:40,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:05:40,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:05:40,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:05:40,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:05:40,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:05:40,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:05:40,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:05:40,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:05:40,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:05:40,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:05:40,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:05:40,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:05:40,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:05:40,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:05:40,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:05:40,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:05:40,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:05:40,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:05:40,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:05:40,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:05:40,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:05:40,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:05:40,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:05:40,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:05:40,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:05:40,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:05:40,129 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 -> 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 [2024-11-09 02:05:40,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:05:40,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:05:40,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:05:40,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:05:40,398 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:05:40,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-11-09 02:05:41,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:05:42,195 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:05:42,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-11-09 02:05:42,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a934733c/b342d0d4dca34b67be8f461f80167e78/FLAG33379637c [2024-11-09 02:05:42,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a934733c/b342d0d4dca34b67be8f461f80167e78 [2024-11-09 02:05:42,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:05:42,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:05:42,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:05:42,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:05:42,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:05:42,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635aba71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42, skipping insertion in model container [2024-11-09 02:05:42,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:05:42,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i[916,929] [2024-11-09 02:05:42,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:05:42,502 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:05:42,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i[916,929] [2024-11-09 02:05:42,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:05:42,572 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:05:42,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42 WrapperNode [2024-11-09 02:05:42,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:05:42,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:05:42,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:05:42,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:05:42,581 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:05:42" (1/1) ... [2024-11-09 02:05:42,596 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:05:42" (1/1) ... [2024-11-09 02:05:42,634 INFO L138 Inliner]: procedures = 30, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2024-11-09 02:05:42,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:05:42,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:05:42,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:05:42,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:05:42,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,665 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:05:42,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:05:42,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:05:42,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:05:42,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:05:42,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42" (1/1) ... [2024-11-09 02:05:42,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:05:42,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:05:42,758 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:05:42,759 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:05:42,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:05:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:05:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:05:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:05:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:05:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:05:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:05:42,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:05:42,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:05:42,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:05:42,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:05:42,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:05:42,901 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:05:42,903 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:05:43,782 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-09 02:05:43,782 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:05:43,801 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:05:43,801 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:05:43,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:05:43 BoogieIcfgContainer [2024-11-09 02:05:43,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:05:43,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:05:43,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:05:43,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:05:43,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:05:42" (1/3) ... [2024-11-09 02:05:43,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adeeee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:05:43, skipping insertion in model container [2024-11-09 02:05:43,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:42" (2/3) ... [2024-11-09 02:05:43,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adeeee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:05:43, skipping insertion in model container [2024-11-09 02:05:43,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:05:43" (3/3) ... [2024-11-09 02:05:43,810 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-68.i [2024-11-09 02:05:43,826 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:05:43,827 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:05:43,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:05:43,888 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;@6f49aa8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:05:43,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:05:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:05:43,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 02:05:43,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:43,911 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:43,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:43,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1572021536, now seen corresponding path program 1 times [2024-11-09 02:05:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:43,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274391020] [2024-11-09 02:05:43,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:05:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:05:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:05:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:05:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:05:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:05:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:05:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:05:44,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:44,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274391020] [2024-11-09 02:05:44,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274391020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:44,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:44,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:05:44,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266828539] [2024-11-09 02:05:44,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:44,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:05:44,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:44,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:05:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:05:44,522 INFO L87 Difference]: Start difference. First operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:05:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:44,572 INFO L93 Difference]: Finished difference Result 221 states and 345 transitions. [2024-11-09 02:05:44,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:05:44,575 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-11-09 02:05:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:44,583 INFO L225 Difference]: With dead ends: 221 [2024-11-09 02:05:44,584 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 02:05:44,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:05:44,594 INFO L432 NwaCegarLoop]: 160 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, 160 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:05:44,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 02:05:44,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 02:05:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:05:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2024-11-09 02:05:44,659 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2024-11-09 02:05:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:44,661 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2024-11-09 02:05:44,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:05:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2024-11-09 02:05:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 02:05:44,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:44,669 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:44,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:05:44,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:44,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:44,671 INFO L85 PathProgramCache]: Analyzing trace with hash -727637382, now seen corresponding path program 1 times [2024-11-09 02:05:44,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:44,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779995464] [2024-11-09 02:05:44,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:44,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:05:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:05:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:05:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:05:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:05:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:05:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:05:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:05:45,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:45,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779995464] [2024-11-09 02:05:45,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779995464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:45,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:45,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:05:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653774211] [2024-11-09 02:05:45,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:45,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:05:45,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:45,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:05:45,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:05:45,212 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:05:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:45,273 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2024-11-09 02:05:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:05:45,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-11-09 02:05:45,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:45,276 INFO L225 Difference]: With dead ends: 219 [2024-11-09 02:05:45,276 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 02:05:45,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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:05:45,280 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 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:05:45,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 02:05:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 02:05:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:05:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2024-11-09 02:05:45,302 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 146 [2024-11-09 02:05:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:45,306 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2024-11-09 02:05:45,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:05:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2024-11-09 02:05:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 02:05:45,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:45,312 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:45,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:05:45,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:45,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:45,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1151493564, now seen corresponding path program 1 times [2024-11-09 02:05:45,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:45,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284005010] [2024-11-09 02:05:45,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:05:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:05:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:05:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:05:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:05:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:05:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:05:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:05:45,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:45,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284005010] [2024-11-09 02:05:45,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284005010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:45,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:45,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:05:45,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78029977] [2024-11-09 02:05:45,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:45,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:05:45,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:45,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:05:45,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:05:45,728 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:45,772 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2024-11-09 02:05:45,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:05:45,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-09 02:05:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:45,774 INFO L225 Difference]: With dead ends: 224 [2024-11-09 02:05:45,775 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 02:05:45,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:05:45,776 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:45,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 02:05:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 02:05:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:05:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-11-09 02:05:45,786 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 146 [2024-11-09 02:05:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:45,787 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-11-09 02:05:45,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-11-09 02:05:45,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 02:05:45,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:45,789 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:45,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:05:45,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:45,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1929675724, now seen corresponding path program 1 times [2024-11-09 02:05:45,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:45,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35818940] [2024-11-09 02:05:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:45,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:05:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:05:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:05:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:05:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:05:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:05:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:05:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:05:46,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35818940] [2024-11-09 02:05:46,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35818940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:46,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:46,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:05:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858166868] [2024-11-09 02:05:46,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:46,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:05:46,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:46,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:05:46,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:05:46,108 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:46,150 INFO L93 Difference]: Finished difference Result 230 states and 331 transitions. [2024-11-09 02:05:46,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:05:46,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-09 02:05:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:46,153 INFO L225 Difference]: With dead ends: 230 [2024-11-09 02:05:46,156 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 02:05:46,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:05:46,158 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:46,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 02:05:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-11-09 02:05:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:05:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-09 02:05:46,171 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 146 [2024-11-09 02:05:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:46,172 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-09 02:05:46,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-09 02:05:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 02:05:46,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:46,177 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:46,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:05:46,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:46,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1747614455, now seen corresponding path program 1 times [2024-11-09 02:05:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:46,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513915241] [2024-11-09 02:05:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:46,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:05:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:05:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:05:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:05:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:05:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:05:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:05:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:05:46,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:46,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513915241] [2024-11-09 02:05:46,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513915241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:46,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:46,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:05:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473642304] [2024-11-09 02:05:46,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:46,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:05:46,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:46,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:05:46,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:05:46,399 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:46,431 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-11-09 02:05:46,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:05:46,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-09 02:05:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:46,435 INFO L225 Difference]: With dead ends: 232 [2024-11-09 02:05:46,435 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 02:05:46,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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:05:46,437 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 460 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:05:46,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 460 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 02:05:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-09 02:05:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:05:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2024-11-09 02:05:46,453 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 148 [2024-11-09 02:05:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:46,454 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2024-11-09 02:05:46,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2024-11-09 02:05:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 02:05:46,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:46,457 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:46,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:05:46,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1846288263, now seen corresponding path program 1 times [2024-11-09 02:05:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708171235] [2024-11-09 02:05:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:05:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:05:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:05:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:05:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:05:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:05:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:05:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:05:46,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:46,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708171235] [2024-11-09 02:05:46,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708171235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:46,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:46,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:05:46,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842124660] [2024-11-09 02:05:46,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:46,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:05:46,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:46,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:05:46,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:05:46,691 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:46,724 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2024-11-09 02:05:46,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:05:46,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-09 02:05:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:46,726 INFO L225 Difference]: With dead ends: 236 [2024-11-09 02:05:46,726 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 02:05:46,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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:05:46,728 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 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:05:46,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 02:05:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-09 02:05:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:05:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-11-09 02:05:46,736 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 148 [2024-11-09 02:05:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:46,736 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-11-09 02:05:46,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:46,737 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-11-09 02:05:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 02:05:46,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:46,738 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:46,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:05:46,739 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:46,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1166229893, now seen corresponding path program 1 times [2024-11-09 02:05:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954185815] [2024-11-09 02:05:46,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:05:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:05:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:05:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:05:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:05:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:05:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:05:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:05:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:46,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954185815] [2024-11-09 02:05:46,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954185815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:46,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:46,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:05:46,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752415466] [2024-11-09 02:05:46,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:46,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:05:46,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:46,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:05:46,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:05:46,959 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:46,987 INFO L93 Difference]: Finished difference Result 240 states and 341 transitions. [2024-11-09 02:05:46,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:05:46,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-09 02:05:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:46,989 INFO L225 Difference]: With dead ends: 240 [2024-11-09 02:05:46,990 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 02:05:46,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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:05:46,991 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 463 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:05:46,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 02:05:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-09 02:05:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:05:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2024-11-09 02:05:47,007 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 148 [2024-11-09 02:05:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:47,007 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2024-11-09 02:05:47,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2024-11-09 02:05:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 02:05:47,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:47,009 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:47,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:05:47,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:47,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1164382851, now seen corresponding path program 1 times [2024-11-09 02:05:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688782151] [2024-11-09 02:05:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:05:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:05:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:05:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:05:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:05:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:05:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:05:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:05:47,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:47,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688782151] [2024-11-09 02:05:47,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688782151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:47,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:47,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:05:47,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713586816] [2024-11-09 02:05:47,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:47,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:05:47,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:47,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:05:47,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:05:47,435 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:47,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:47,444 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2024-11-09 02:05:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:05:47,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-09 02:05:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:47,448 INFO L225 Difference]: With dead ends: 241 [2024-11-09 02:05:47,449 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 02:05:47,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:05:47,450 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:47,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 02:05:47,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 02:05:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:05:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-11-09 02:05:47,460 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 148 [2024-11-09 02:05:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:47,461 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-11-09 02:05:47,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-11-09 02:05:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 02:05:47,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:47,463 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:47,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:05:47,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:47,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:47,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1102343237, now seen corresponding path program 1 times [2024-11-09 02:05:47,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:47,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840497006] [2024-11-09 02:05:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:47,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:05:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:05:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:05:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:05:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:05:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:05:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:05:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:05:47,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:47,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840497006] [2024-11-09 02:05:47,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840497006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:47,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:47,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:05:47,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236715562] [2024-11-09 02:05:47,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:47,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:05:47,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:47,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:05:47,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:05:47,735 INFO L87 Difference]: Start difference. First operand 122 states and 171 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:48,396 INFO L93 Difference]: Finished difference Result 307 states and 435 transitions. [2024-11-09 02:05:48,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:05:48,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-09 02:05:48,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:48,399 INFO L225 Difference]: With dead ends: 307 [2024-11-09 02:05:48,399 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 02:05:48,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:05:48,401 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 130 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:48,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 544 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:05:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 02:05:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 122. [2024-11-09 02:05:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 103 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:05:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 170 transitions. [2024-11-09 02:05:48,408 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 170 transitions. Word has length 148 [2024-11-09 02:05:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:48,409 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 170 transitions. [2024-11-09 02:05:48,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 170 transitions. [2024-11-09 02:05:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 02:05:48,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:48,411 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:48,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:05:48,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:48,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2123411591, now seen corresponding path program 1 times [2024-11-09 02:05:48,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574472513] [2024-11-09 02:05:48,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:05:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:05:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:05:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:05:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:05:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:05:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:05:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:05:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:05:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:05:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:05:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:05:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:05:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:05:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:05:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:05:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:05:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:05:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:05:48,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:05:48,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574472513] [2024-11-09 02:05:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574472513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:05:48,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:05:48,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:05:48,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416283653] [2024-11-09 02:05:48,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:05:48,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:05:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:05:48,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:05:48,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:05:48,675 INFO L87 Difference]: Start difference. First operand 122 states and 170 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:05:48,701 INFO L93 Difference]: Finished difference Result 243 states and 340 transitions. [2024-11-09 02:05:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:05:48,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-09 02:05:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:05:48,705 INFO L225 Difference]: With dead ends: 243 [2024-11-09 02:05:48,705 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 02:05:48,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:05:48,706 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:05:48,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:05:48,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 02:05:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 02:05:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 105 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:05:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2024-11-09 02:05:48,715 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 148 [2024-11-09 02:05:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:05:48,716 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2024-11-09 02:05:48,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:05:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2024-11-09 02:05:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 02:05:48,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:48,719 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:48,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:05:48,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:48,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:48,720 INFO L85 PathProgramCache]: Analyzing trace with hash 337311973, now seen corresponding path program 1 times [2024-11-09 02:05:48,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:48,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090490784] [2024-11-09 02:05:48,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:48,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:05:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 02:05:48,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398774749] [2024-11-09 02:05:48,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:48,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:05:48,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:05:48,867 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:05:48,868 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:05:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:05:49,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:05:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:05:50,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:05:50,899 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:05:50,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:05:50,917 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:05:51,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 02:05:51,109 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:05:51,202 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:05:51,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:05:51 BoogieIcfgContainer [2024-11-09 02:05:51,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:05:51,206 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:05:51,206 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:05:51,206 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:05:51,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:05:43" (3/4) ... [2024-11-09 02:05:51,209 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:05:51,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:05:51,211 INFO L158 Benchmark]: Toolchain (without parser) took 8987.60ms. Allocated memory was 161.5MB in the beginning and 274.7MB in the end (delta: 113.2MB). Free memory was 105.1MB in the beginning and 124.2MB in the end (delta: -19.2MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. [2024-11-09 02:05:51,211 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 161.5MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:05:51,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.03ms. Allocated memory is still 161.5MB. Free memory was 104.6MB in the beginning and 84.6MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 02:05:51,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.19ms. Allocated memory is still 161.5MB. Free memory was 84.6MB in the beginning and 80.9MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:05:51,212 INFO L158 Benchmark]: Boogie Preprocessor took 70.06ms. Allocated memory is still 161.5MB. Free memory was 80.9MB in the beginning and 76.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:05:51,212 INFO L158 Benchmark]: RCFGBuilder took 1095.24ms. Allocated memory is still 161.5MB. Free memory was 76.9MB in the beginning and 109.2MB in the end (delta: -32.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-11-09 02:05:51,213 INFO L158 Benchmark]: TraceAbstraction took 7401.34ms. Allocated memory was 161.5MB in the beginning and 274.7MB in the end (delta: 113.2MB). Free memory was 108.4MB in the beginning and 124.2MB in the end (delta: -15.9MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. [2024-11-09 02:05:51,213 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 274.7MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:05:51,215 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.22ms. Allocated memory is still 161.5MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.03ms. Allocated memory is still 161.5MB. Free memory was 104.6MB in the beginning and 84.6MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.19ms. Allocated memory is still 161.5MB. Free memory was 84.6MB in the beginning and 80.9MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.06ms. Allocated memory is still 161.5MB. Free memory was 80.9MB in the beginning and 76.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1095.24ms. Allocated memory is still 161.5MB. Free memory was 76.9MB in the beginning and 109.2MB in the end (delta: -32.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7401.34ms. Allocated memory was 161.5MB in the beginning and 274.7MB in the end (delta: 113.2MB). Free memory was 108.4MB in the beginning and 124.2MB in the end (delta: -15.9MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 274.7MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 129. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L61] signed short int last_1_WrapperStruct00_var_1_13 = -25; [L62] signed long int last_1_WrapperStruct00_var_1_17 = 5; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L125] EXPR WrapperStruct00.var_1_13 [L125] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L126] EXPR WrapperStruct00.var_1_17 [L126] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L136] RET updateLastVariables() [L137] CALL updateVariables() [L96] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L97] EXPR WrapperStruct00.var_1_2 [L97] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_2 [L97] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L98] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L99] EXPR WrapperStruct00.var_1_3 [L99] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_3 [L99] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L109] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_12 [L110] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_12 [L110] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L111] WrapperStruct00.var_1_14 = __VERIFIER_nondet_short() [L112] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L114] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L115] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L117] WrapperStruct00.var_1_16 = __VERIFIER_nondet_short() [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L120] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ulong() [L121] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L137] RET updateVariables() [L138] CALL step() [L66] EXPR WrapperStruct00.var_1_8 [L66] signed long int stepLocal_2 = WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17; [L67] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_2=16] [L67] COND FALSE !(WrapperStruct00.var_1_9) [L74] EXPR WrapperStruct00.var_1_15 [L74] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_15 [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_14 [L76] WrapperStruct00.var_1_17 = (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14) [L77] EXPR WrapperStruct00.var_1_19 [L77] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L78] EXPR WrapperStruct00.var_1_12 [L78] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_12 [L79] EXPR WrapperStruct00.var_1_17 [L79] WrapperStruct00.var_1_21 = WrapperStruct00.var_1_17 [L80] EXPR WrapperStruct00.var_1_17 [L80] signed long int stepLocal_1 = WrapperStruct00.var_1_17; [L81] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_1=-10, stepLocal_2=16] [L81] COND FALSE !(stepLocal_1 != WrapperStruct00.var_1_21) [L84] EXPR WrapperStruct00.var_1_18 [L84] EXPR WrapperStruct00.var_1_21 [L84] unsigned long int stepLocal_0 = WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21; [L85] EXPR WrapperStruct00.var_1_2 [L85] EXPR WrapperStruct00.var_1_3 [L85] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_0=-4294967297, stepLocal_2=16] [L85] COND FALSE !((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) [L90] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_0=-4294967297, stepLocal_2=16] [L90] COND FALSE !(WrapperStruct00.var_1_9) [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR WrapperStruct00.var_1_2 [L129] EXPR WrapperStruct00.var_1_3 [L129] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1) [L129] EXPR WrapperStruct00.var_1_18 [L129] EXPR WrapperStruct00.var_1_21 [L129] EXPR WrapperStruct00.var_1_13 [L129] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1 [L129] EXPR WrapperStruct00.var_1_1 [L129] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21) [L129] EXPR WrapperStruct00.var_1_21 [L129] EXPR ((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129-L130] return ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17)) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 11, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 4699 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3096 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 455 IncrementalHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1603 mSDtfsCounter, 455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=10, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1768 NumberOfCodeBlocks, 1768 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1462 ConstructedInterpolants, 0 QuantifiedInterpolants, 1633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 5440/5440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 02:05:51,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.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 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:05:53,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:05:53,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:05:53,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:05:53,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:05:53,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:05:53,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:05:53,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:05:53,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:05:53,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:05:53,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:05:53,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:05:53,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:05:53,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:05:53,620 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:05:53,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:05:53,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:05:53,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:05:53,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:05:53,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:05:53,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:05:53,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:05:53,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:05:53,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:05:53,624 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:05:53,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:05:53,624 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:05:53,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:05:53,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:05:53,625 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:05:53,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:05:53,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:05:53,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:05:53,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:05:53,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:05:53,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:05:53,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:05:53,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:05:53,630 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:05:53,630 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:05:53,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:05:53,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:05:53,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:05:53,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:05:53,633 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 -> 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 [2024-11-09 02:05:53,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:05:53,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:05:53,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:05:53,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:05:53,999 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:05:54,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-11-09 02:05:55,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:05:55,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:05:55,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-11-09 02:05:55,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556d534f7/b50faaf6ae294172ac6bba68bcf5587a/FLAG23f38271f [2024-11-09 02:05:56,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556d534f7/b50faaf6ae294172ac6bba68bcf5587a [2024-11-09 02:05:56,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:05:56,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:05:56,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:05:56,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:05:56,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:05:56,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779678c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56, skipping insertion in model container [2024-11-09 02:05:56,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:05:56,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i[916,929] [2024-11-09 02:05:56,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:05:56,458 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:05:56,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i[916,929] [2024-11-09 02:05:56,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:05:56,592 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:05:56,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56 WrapperNode [2024-11-09 02:05:56,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:05:56,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:05:56,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:05:56,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:05:56,602 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:05:56" (1/1) ... [2024-11-09 02:05:56,630 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:05:56" (1/1) ... [2024-11-09 02:05:56,684 INFO L138 Inliner]: procedures = 40, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 505 [2024-11-09 02:05:56,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:05:56,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:05:56,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:05:56,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:05:56,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,754 INFO L175 MemorySlicer]: Split 143 memory accesses to 2 slices as follows [2, 141]. 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:05:56,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:05:56,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:05:56,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:05:56,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:05:56,824 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56" (1/1) ... [2024-11-09 02:05:56,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:05:56,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:05:56,861 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:05:56,869 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:05:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:05:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 02:05:56,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 02:05:56,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-09 02:05:56,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-09 02:05:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 02:05:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 02:05:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:05:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:05:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:05:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:05:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 02:05:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 02:05:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 02:05:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 02:05:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 02:05:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 02:05:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-09 02:05:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-09 02:05:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 02:05:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 02:05:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-09 02:05:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-09 02:05:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:05:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:05:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:05:56,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:05:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 02:05:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 02:05:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:05:56,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:05:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:05:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:05:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 02:05:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 02:05:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 02:05:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 02:05:57,079 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:05:57,081 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:06:00,679 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-09 02:06:00,679 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:06:00,698 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:06:00,698 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:06:00,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:06:00 BoogieIcfgContainer [2024-11-09 02:06:00,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:06:00,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:06:00,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:06:00,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:06:00,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:05:56" (1/3) ... [2024-11-09 02:06:00,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548d38df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:06:00, skipping insertion in model container [2024-11-09 02:06:00,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:56" (2/3) ... [2024-11-09 02:06:00,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548d38df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:06:00, skipping insertion in model container [2024-11-09 02:06:00,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:06:00" (3/3) ... [2024-11-09 02:06:00,708 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-68.i [2024-11-09 02:06:00,725 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:06:00,726 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:06:00,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:06:00,788 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;@5e3cbec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:06:00,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:06:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:06:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 02:06:00,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:00,813 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:00,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:00,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:00,821 INFO L85 PathProgramCache]: Analyzing trace with hash -396336112, now seen corresponding path program 1 times [2024-11-09 02:06:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:06:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062804893] [2024-11-09 02:06:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:00,839 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:06:00,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:06:00,843 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:06:00,847 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:06:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:06:01,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:06:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-09 02:06:01,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:06:01,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:06:01,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062804893] [2024-11-09 02:06:01,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062804893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:01,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:01,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:06:01,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881483385] [2024-11-09 02:06:01,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:01,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:06:01,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:06:01,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:06:01,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:06:01,558 INFO L87 Difference]: Start difference. First operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:06:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:01,589 INFO L93 Difference]: Finished difference Result 221 states and 345 transitions. [2024-11-09 02:06:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:06:01,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-11-09 02:06:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:01,603 INFO L225 Difference]: With dead ends: 221 [2024-11-09 02:06:01,603 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 02:06:01,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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:06:01,611 INFO L432 NwaCegarLoop]: 160 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, 160 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:06:01,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:06:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 02:06:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 02:06:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:06:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2024-11-09 02:06:01,655 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2024-11-09 02:06:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:01,655 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2024-11-09 02:06:01,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:06:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2024-11-09 02:06:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 02:06:01,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:01,659 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:01,677 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:06:01,860 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:06:01,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:01,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:01,862 INFO L85 PathProgramCache]: Analyzing trace with hash 448048042, now seen corresponding path program 1 times [2024-11-09 02:06:01,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:06:01,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066582560] [2024-11-09 02:06:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:01,863 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:06:01,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:06:01,866 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:06:01,867 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:06:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:06:02,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:06:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:06:02,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:06:02,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:06:02,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066582560] [2024-11-09 02:06:02,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066582560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:02,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:02,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:06:02,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454276599] [2024-11-09 02:06:02,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:02,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:06:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:06:02,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:06:02,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:02,546 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:02,630 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2024-11-09 02:06:02,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:06:02,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-09 02:06:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:02,635 INFO L225 Difference]: With dead ends: 220 [2024-11-09 02:06:02,636 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 02:06:02,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:02,639 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:02,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:06:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 02:06:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 02:06:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:06:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-11-09 02:06:02,654 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 146 [2024-11-09 02:06:02,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:02,656 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-11-09 02:06:02,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-11-09 02:06:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 02:06:02,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:02,669 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:02,685 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:06:02,869 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:06:02,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:02,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1226230202, now seen corresponding path program 1 times [2024-11-09 02:06:02,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:06:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583712918] [2024-11-09 02:06:02,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:02,872 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:06:02,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:06:02,874 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:06:02,875 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:06:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:06:03,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:06:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:06:03,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:06:03,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:06:03,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583712918] [2024-11-09 02:06:03,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583712918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:03,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:03,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:06:03,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346523574] [2024-11-09 02:06:03,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:03,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:06:03,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:06:03,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:06:03,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:03,483 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:03,538 INFO L93 Difference]: Finished difference Result 226 states and 327 transitions. [2024-11-09 02:06:03,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:06:03,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-09 02:06:03,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:03,540 INFO L225 Difference]: With dead ends: 226 [2024-11-09 02:06:03,540 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 02:06:03,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:03,542 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:03,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:06:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 02:06:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-09 02:06:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:06:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-09 02:06:03,564 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 146 [2024-11-09 02:06:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:03,565 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-09 02:06:03,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-09 02:06:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 02:06:03,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:03,570 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:03,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 02:06:03,771 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:06:03,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:03,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash 370033551, now seen corresponding path program 1 times [2024-11-09 02:06:03,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:06:03,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127951886] [2024-11-09 02:06:03,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:03,780 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:06:03,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:06:03,783 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:06:03,784 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:06:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:06:04,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:06:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:06:04,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:06:04,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:06:04,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127951886] [2024-11-09 02:06:04,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127951886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:04,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:04,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:06:04,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547838557] [2024-11-09 02:06:04,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:04,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:06:04,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:06:04,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:06:04,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:04,418 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:04,482 INFO L93 Difference]: Finished difference Result 230 states and 332 transitions. [2024-11-09 02:06:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:06:04,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-09 02:06:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:04,487 INFO L225 Difference]: With dead ends: 230 [2024-11-09 02:06:04,487 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 02:06:04,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:04,492 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:04,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 604 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:06:04,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 02:06:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-09 02:06:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:06:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2024-11-09 02:06:04,508 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 148 [2024-11-09 02:06:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:04,510 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2024-11-09 02:06:04,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2024-11-09 02:06:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 02:06:04,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:04,512 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:04,536 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:06:04,719 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:06:04,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:04,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1071098129, now seen corresponding path program 1 times [2024-11-09 02:06:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:06:04,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611830589] [2024-11-09 02:06:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:04,721 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:06:04,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:06:04,725 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:06:04,726 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:06:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:05,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 02:06:05,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:06:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:06:05,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:06:05,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:06:05,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611830589] [2024-11-09 02:06:05,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611830589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:05,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:05,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:06:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283536553] [2024-11-09 02:06:05,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:05,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:06:05,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:06:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:06:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:06:05,341 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:05,720 INFO L93 Difference]: Finished difference Result 238 states and 340 transitions. [2024-11-09 02:06:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:06:05,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-09 02:06:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:05,723 INFO L225 Difference]: With dead ends: 238 [2024-11-09 02:06:05,723 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 02:06:05,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 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:06:05,725 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:05,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 882 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:06:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 02:06:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-09 02:06:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:06:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2024-11-09 02:06:05,733 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 148 [2024-11-09 02:06:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:05,734 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2024-11-09 02:06:05,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2024-11-09 02:06:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 02:06:05,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:05,736 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:05,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 02:06:05,937 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:06:05,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:05,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1448861805, now seen corresponding path program 1 times [2024-11-09 02:06:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:06:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060216895] [2024-11-09 02:06:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:05,939 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:06:05,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:06:05,942 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:06:05,943 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:06:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 02:06:06,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:06:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:06:06,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:06:06,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:06:06,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060216895] [2024-11-09 02:06:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060216895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:06,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:06:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263145127] [2024-11-09 02:06:06,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:06,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:06:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:06:06,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:06:06,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:06:06,457 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:06,643 INFO L93 Difference]: Finished difference Result 244 states and 345 transitions. [2024-11-09 02:06:06,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:06:06,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-09 02:06:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:06,648 INFO L225 Difference]: With dead ends: 244 [2024-11-09 02:06:06,648 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 02:06:06,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 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:06:06,652 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1021 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:06,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1021 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:06:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 02:06:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-09 02:06:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:06:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 174 transitions. [2024-11-09 02:06:06,668 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 174 transitions. Word has length 148 [2024-11-09 02:06:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:06,668 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 174 transitions. [2024-11-09 02:06:06,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 174 transitions. [2024-11-09 02:06:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 02:06:06,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:06,676 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:06,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 02:06:06,876 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:06:06,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:06,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1447014763, now seen corresponding path program 1 times [2024-11-09 02:06:06,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:06:06,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162015849] [2024-11-09 02:06:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:06,878 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:06:06,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:06:06,879 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:06:06,880 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:06:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:06:07,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:06:07,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-09 02:06:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 02:06:07,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:06:07,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:06:07,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162015849] [2024-11-09 02:06:07,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162015849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:07,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:07,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:06:07,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062192139] [2024-11-09 02:06:07,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:07,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:06:07,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:06:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:06:07,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:07,535 INFO L87 Difference]: Start difference. First operand 124 states and 174 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:09,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:06:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:11,761 INFO L93 Difference]: Finished difference Result 246 states and 346 transitions. [2024-11-09 02:06:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:06:11,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-09 02:06:11,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:11,763 INFO L225 Difference]: With dead ends: 246 [2024-11-09 02:06:11,763 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 02:06:11,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:06:11,766 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 154 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:11,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 453 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 02:06:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 02:06:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-09 02:06:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:06:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2024-11-09 02:06:11,779 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 148 [2024-11-09 02:06:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:11,779 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2024-11-09 02:06:11,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 02:06:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2024-11-09 02:06:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 02:06:11,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:11,784 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:11,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 (8)] Ended with exit code 0 [2024-11-09 02:06:11,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:06:11,985 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1325732517, now seen corresponding path program 1 times [2024-11-09 02:06:11,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:06:11,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686835020] [2024-11-09 02:06:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:11,986 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:06:11,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:06:11,988 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:06:11,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 02:06:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:06:12,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:06:12,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-09 02:06:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:06:12,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:06:12,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:06:12,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686835020] [2024-11-09 02:06:12,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686835020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:12,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:12,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:06:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422640906] [2024-11-09 02:06:12,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:12,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:06:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:06:12,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:06:12,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:12,555 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:06:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:15,405 INFO L93 Difference]: Finished difference Result 246 states and 344 transitions. [2024-11-09 02:06:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:06:15,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-11-09 02:06:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:15,406 INFO L225 Difference]: With dead ends: 246 [2024-11-09 02:06:15,406 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 02:06:15,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:06:15,408 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 143 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:15,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 448 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 02:06:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 02:06:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-09 02:06:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 105 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:06:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2024-11-09 02:06:15,417 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 150 [2024-11-09 02:06:15,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:15,417 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2024-11-09 02:06:15,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:06:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2024-11-09 02:06:15,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 02:06:15,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:15,419 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:15,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 02:06:15,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:06:15,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:15,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash -619345195, now seen corresponding path program 1 times [2024-11-09 02:06:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:06:15,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72770283] [2024-11-09 02:06:15,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:15,622 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:06:15,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:06:15,623 INFO L229 MonitoredProcess]: Starting monitored process 10 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:06:15,624 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 (10)] Waiting until timeout for monitored process [2024-11-09 02:06:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:06:16,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:06:16,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:06:16,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-09 02:06:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:16,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:06:16,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:06:16,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72770283] [2024-11-09 02:06:16,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72770283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:16,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:16,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:06:16,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319402811] [2024-11-09 02:06:16,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:16,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:06:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:06:16,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:06:16,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:16,311 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:06:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:18,588 INFO L93 Difference]: Finished difference Result 246 states and 342 transitions. [2024-11-09 02:06:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:06:18,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2024-11-09 02:06:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:18,590 INFO L225 Difference]: With dead ends: 246 [2024-11-09 02:06:18,590 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 02:06:18,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:06:18,591 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 118 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:18,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 447 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 02:06:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 02:06:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-09 02:06:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3047619047619048) internal successors, (137), 105 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:06:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2024-11-09 02:06:18,598 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 152 [2024-11-09 02:06:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:18,598 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2024-11-09 02:06:18,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:06:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2024-11-09 02:06:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 02:06:18,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:18,600 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:18,621 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 (10)] Ended with exit code 0 [2024-11-09 02:06:18,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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:06:18,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:18,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:18,801 INFO L85 PathProgramCache]: Analyzing trace with hash 634739291, now seen corresponding path program 1 times [2024-11-09 02:06:18,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:06:18,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776463599] [2024-11-09 02:06:18,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:18,802 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:06:18,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:06:18,803 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:06:18,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 02:06:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:06:19,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:06:19,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:06:19,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-09 02:06:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-09 02:06:19,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:06:19,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:06:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776463599] [2024-11-09 02:06:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776463599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:19,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:19,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:06:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150070269] [2024-11-09 02:06:19,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:19,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:06:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:06:19,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:06:19,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:19,524 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:06:20,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:06:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:22,654 INFO L93 Difference]: Finished difference Result 246 states and 340 transitions. [2024-11-09 02:06:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:06:22,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2024-11-09 02:06:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:22,656 INFO L225 Difference]: With dead ends: 246 [2024-11-09 02:06:22,656 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 02:06:22,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:06:22,657 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 109 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:22,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 441 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 02:06:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 02:06:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-09 02:06:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 02:06:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2024-11-09 02:06:22,665 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 154 [2024-11-09 02:06:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:22,666 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2024-11-09 02:06:22,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 02:06:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2024-11-09 02:06:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 02:06:22,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:22,667 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:22,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 02:06:22,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:06:22,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:22,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:22,869 INFO L85 PathProgramCache]: Analyzing trace with hash -845520363, now seen corresponding path program 1 times [2024-11-09 02:06:22,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:06:22,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795666948] [2024-11-09 02:06:22,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:22,870 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:06:22,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:06:22,871 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:06:22,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process