./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-48.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 6af22983044ba27ae435cb0dcfcd33ee0fc69f0bc5638fc1b6ee52bc6b6af1dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:48:43,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:48:43,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:48:43,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:48:43,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:48:43,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:48:43,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:48:43,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:48:43,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:48:43,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:48:43,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:48:43,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:48:43,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:48:43,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:48:43,661 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:48:43,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:48:43,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:48:43,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:48:43,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:48:43,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:48:43,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:48:43,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:48:43,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:48:43,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:48:43,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:48:43,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:48:43,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:48:43,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:48:43,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:48:43,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:48:43,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:48:43,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:48:43,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:48:43,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:48:43,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:48:43,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:48:43,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:48:43,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:48:43,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:48:43,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:48:43,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:48:43,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:48:43,669 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 -> 6af22983044ba27ae435cb0dcfcd33ee0fc69f0bc5638fc1b6ee52bc6b6af1dd [2024-10-24 11:48:43,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:48:43,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:48:43,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:48:43,971 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:48:43,972 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:48:43,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-48.i [2024-10-24 11:48:45,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:48:45,601 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:48:45,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-48.i [2024-10-24 11:48:45,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/198bfa4c5/33578999c6ed4fb59dc0cb7c45d82bb8/FLAGc8e12aa47 [2024-10-24 11:48:45,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/198bfa4c5/33578999c6ed4fb59dc0cb7c45d82bb8 [2024-10-24 11:48:45,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:48:45,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:48:45,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:48:45,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:48:45,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:48:45,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:45,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b35553f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45, skipping insertion in model container [2024-10-24 11:48:45,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:45,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:48:45,828 WARN L248 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-48.i[916,929] [2024-10-24 11:48:45,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:48:45,897 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:48:45,910 WARN L248 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-48.i[916,929] [2024-10-24 11:48:45,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:48:45,965 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:48:45,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45 WrapperNode [2024-10-24 11:48:45,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:48:45,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:48:45,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:48:45,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:48:45,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:45,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:46,035 INFO L138 Inliner]: procedures = 29, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-10-24 11:48:46,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:48:46,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:48:46,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:48:46,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:48:46,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:46,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:46,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:46,078 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 21 initializations are split as follows [2, 19]. The 23 writes are split as follows [0, 23]. [2024-10-24 11:48:46,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:46,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:46,118 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:46,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:46,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:46,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:46,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:48:46,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:48:46,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:48:46,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:48:46,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (1/1) ... [2024-10-24 11:48:46,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:48:46,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:48:46,211 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-10-24 11:48:46,214 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-10-24 11:48:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:48:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:48:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:48:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:48:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:48:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:48:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:48:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:48:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:48:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:48:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:48:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:48:46,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:48:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:48:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:48:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:48:46,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:48:46,358 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:48:46,360 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:48:46,827 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-24 11:48:46,828 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:48:46,870 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:48:46,870 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:48:46,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:46 BoogieIcfgContainer [2024-10-24 11:48:46,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:48:46,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:48:46,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:48:46,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:48:46,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:48:45" (1/3) ... [2024-10-24 11:48:46,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d0954d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:48:46, skipping insertion in model container [2024-10-24 11:48:46,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:45" (2/3) ... [2024-10-24 11:48:46,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d0954d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:48:46, skipping insertion in model container [2024-10-24 11:48:46,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:46" (3/3) ... [2024-10-24 11:48:46,881 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-48.i [2024-10-24 11:48:46,897 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:48:46,898 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:48:47,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:48:47,053 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;@5f91a953, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:48:47,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:48:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:48:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:48:47,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:47,077 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:47,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:47,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1485664768, now seen corresponding path program 1 times [2024-10-24 11:48:47,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:47,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053335905] [2024-10-24 11:48:47,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:47,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:48:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:48:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:48:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:48:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:48:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:48:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:48:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:48:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:48:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:48:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:48:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:48:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:48:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:48:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:48:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:48:47,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:47,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053335905] [2024-10-24 11:48:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053335905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:47,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:47,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:48:47,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43558279] [2024-10-24 11:48:47,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:47,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:48:47,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:48:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:48:47,594 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:48:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:47,651 INFO L93 Difference]: Finished difference Result 219 states and 351 transitions. [2024-10-24 11:48:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:48:47,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-24 11:48:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:47,662 INFO L225 Difference]: With dead ends: 219 [2024-10-24 11:48:47,664 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 11:48:47,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-10-24 11:48:47,673 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 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-10-24 11:48:47,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 11:48:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-24 11:48:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:48:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-10-24 11:48:47,720 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 163 [2024-10-24 11:48:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:47,720 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-10-24 11:48:47,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:48:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-10-24 11:48:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:48:47,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:47,726 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:47,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:48:47,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:47,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash 267758622, now seen corresponding path program 1 times [2024-10-24 11:48:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:47,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585940797] [2024-10-24 11:48:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:47,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:48:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:48:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:48:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:48:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:48:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:48:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:48:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:48:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:48:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:48:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:48:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:48:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:48:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:48:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:48:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:48:48,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:48,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585940797] [2024-10-24 11:48:48,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585940797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:48,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:48,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:48:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578623439] [2024-10-24 11:48:48,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:48,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:48:48,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:48,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:48:48,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:48,244 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:48:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:48,292 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2024-10-24 11:48:48,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:48:48,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:48:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:48,295 INFO L225 Difference]: With dead ends: 220 [2024-10-24 11:48:48,295 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 11:48:48,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-10-24 11:48:48,300 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:48,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 449 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:48,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 11:48:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-24 11:48:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:48:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-10-24 11:48:48,320 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 163 [2024-10-24 11:48:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:48,322 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-10-24 11:48:48,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:48:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-10-24 11:48:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:48:48,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:48,330 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:48,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:48:48,330 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:48,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash -541588004, now seen corresponding path program 1 times [2024-10-24 11:48:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:48,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892996166] [2024-10-24 11:48:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:48:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:48:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:48:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:48:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:48:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:48:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:48:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:48:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:48:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:48:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:48:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:48:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:48:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:48:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:48:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:48:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:48,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892996166] [2024-10-24 11:48:48,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892996166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:48,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:48,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:48:48,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668906109] [2024-10-24 11:48:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:48,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:48:48,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:48,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:48:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:48,613 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:48:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:48,673 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2024-10-24 11:48:48,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:48:48,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:48:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:48,677 INFO L225 Difference]: With dead ends: 224 [2024-10-24 11:48:48,677 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 11:48:48,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-10-24 11:48:48,681 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:48,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 450 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 11:48:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-24 11:48:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:48:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-10-24 11:48:48,700 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 163 [2024-10-24 11:48:48,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:48,704 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-10-24 11:48:48,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:48:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-10-24 11:48:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:48:48,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:48,708 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:48,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:48:48,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:48,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:48,709 INFO L85 PathProgramCache]: Analyzing trace with hash -484329702, now seen corresponding path program 1 times [2024-10-24 11:48:48,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:48,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808399565] [2024-10-24 11:48:48,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:48:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:48:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:48:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:48:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:48:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:48:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:48:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:48:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:48:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:48:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:48:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:48:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:48:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:48:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:48:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:48:48,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:48,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808399565] [2024-10-24 11:48:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808399565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:48,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:48,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:48:48,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905876392] [2024-10-24 11:48:48,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:48,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:48:48,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:48,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:48:48,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:48,939 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:48:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:48,983 INFO L93 Difference]: Finished difference Result 228 states and 329 transitions. [2024-10-24 11:48:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:48:48,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:48:48,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:48,986 INFO L225 Difference]: With dead ends: 228 [2024-10-24 11:48:48,986 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:48:48,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-10-24 11:48:48,990 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:48,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 453 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:48:48,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-24 11:48:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:48:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-10-24 11:48:49,001 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 163 [2024-10-24 11:48:49,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:49,002 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-10-24 11:48:49,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:48:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-10-24 11:48:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:48:49,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:49,004 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:49,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:48:49,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:49,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:49,005 INFO L85 PathProgramCache]: Analyzing trace with hash -484270120, now seen corresponding path program 1 times [2024-10-24 11:48:49,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:49,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488651526] [2024-10-24 11:48:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:49,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:48:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:48:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:48:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:48:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:48:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:48:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:48:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:48:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:48:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:48:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:48:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:48:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:48:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:48:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:48:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:48:51,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:51,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488651526] [2024-10-24 11:48:51,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488651526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:51,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:51,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:48:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618279633] [2024-10-24 11:48:51,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:51,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:48:51,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:51,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:48:51,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:48:51,078 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 6 states, 3 states have (on average 20.333333333333332) internal successors, (61), 6 states have internal predecessors, (61), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 11:48:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:51,292 INFO L93 Difference]: Finished difference Result 229 states and 329 transitions. [2024-10-24 11:48:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:48:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 3 states have (on average 20.333333333333332) internal successors, (61), 6 states have internal predecessors, (61), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) Word has length 163 [2024-10-24 11:48:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:51,295 INFO L225 Difference]: With dead ends: 229 [2024-10-24 11:48:51,296 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 11:48:51,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:48:51,297 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:51,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 556 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:48:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 11:48:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 11:48:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:48:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2024-10-24 11:48:51,312 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 163 [2024-10-24 11:48:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:51,313 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2024-10-24 11:48:51,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 3 states have (on average 20.333333333333332) internal successors, (61), 6 states have internal predecessors, (61), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 11:48:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2024-10-24 11:48:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:48:51,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:51,316 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:51,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:48:51,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:51,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:51,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1816552470, now seen corresponding path program 1 times [2024-10-24 11:48:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:51,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672825399] [2024-10-24 11:48:51,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:48:51,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:48:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:48:51,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:48:51,563 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:48:51,565 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:48:51,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:48:51,569 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 11:48:51,666 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:48:51,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:48:51 BoogieIcfgContainer [2024-10-24 11:48:51,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:48:51,673 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:48:51,673 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:48:51,673 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:48:51,674 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:46" (3/4) ... [2024-10-24 11:48:51,676 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:48:51,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:48:51,678 INFO L158 Benchmark]: Toolchain (without parser) took 6047.79ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 129.5MB in the beginning and 174.0MB in the end (delta: -44.4MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-10-24 11:48:51,678 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:48:51,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.00ms. Allocated memory is still 159.4MB. Free memory was 128.5MB in the beginning and 109.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 11:48:51,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.97ms. Allocated memory is still 159.4MB. Free memory was 109.6MB in the beginning and 104.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:48:51,679 INFO L158 Benchmark]: Boogie Preprocessor took 115.44ms. Allocated memory is still 159.4MB. Free memory was 104.4MB in the beginning and 99.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:48:51,679 INFO L158 Benchmark]: RCFGBuilder took 718.11ms. Allocated memory is still 159.4MB. Free memory was 99.1MB in the beginning and 60.3MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-24 11:48:51,679 INFO L158 Benchmark]: TraceAbstraction took 4800.03ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 59.3MB in the beginning and 175.0MB in the end (delta: -115.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:48:51,680 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 243.3MB. Free memory was 175.0MB in the beginning and 174.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:48:51,681 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.16ms. Allocated memory is still 117.4MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.00ms. Allocated memory is still 159.4MB. Free memory was 128.5MB in the beginning and 109.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.97ms. Allocated memory is still 159.4MB. Free memory was 109.6MB in the beginning and 104.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.44ms. Allocated memory is still 159.4MB. Free memory was 104.4MB in the beginning and 99.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 718.11ms. Allocated memory is still 159.4MB. Free memory was 99.1MB in the beginning and 60.3MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4800.03ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 59.3MB in the beginning and 175.0MB in the end (delta: -115.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 243.3MB. Free memory was 175.0MB in the beginning and 174.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 135. Possible FailurePath: [L43] unsigned char isInitial = 0; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L65] unsigned char last_1_WrapperStruct00_var_1_7 = 5; [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] CALL updateLastVariables() [L132] EXPR WrapperStruct00.var_1_7 [L132] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L142] RET updateLastVariables() [L143] CALL updateVariables() [L96] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L97] EXPR WrapperStruct00.var_1_2 [L97] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L97] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_2 [L97] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L97] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && 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_7=5] [L97] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && 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_7=5] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && 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_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && 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_7=5] [L98] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L99] EXPR WrapperStruct00.var_1_3 [L99] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L99] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_3 [L99] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L99] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && 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_7=5] [L99] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && 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_7=5] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && 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_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && 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_7=5] [L100] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L101] EXPR WrapperStruct00.var_1_4 [L101] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L101] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_4 [L101] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L101] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L101] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L102] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_5 [L103] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L103] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_5 [L103] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L103] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L103] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L104] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L105] EXPR WrapperStruct00.var_1_6 [L105] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L105] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_6 [L105] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L105] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L105] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L106] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 190) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 190) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L108] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L109] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L111] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L114] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L115] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L117] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L118] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L120] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L121] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L123] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L124] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L125] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L126] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L127] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L128] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L129] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L143] RET updateVariables() [L144] CALL step() [L69] EXPR WrapperStruct00.var_1_2 [L69] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L69] COND FALSE !(WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) [L76] EXPR WrapperStruct00.var_1_6 [L76] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_6 [L78] EXPR WrapperStruct00.var_1_14 [L78] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_14 [L79] EXPR WrapperStruct00.var_1_17 [L79] WrapperStruct00.var_1_21 = WrapperStruct00.var_1_17 [L80] WrapperStruct00.var_1_22 = 4 [L81] EXPR WrapperStruct00.var_1_21 [L81] signed long int stepLocal_0 = WrapperStruct00.var_1_21; [L82] EXPR WrapperStruct00.var_1_17 [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L82] COND FALSE !(((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_12) - (8 + WrapperStruct00.var_1_18)) > stepLocal_0) [L85] EXPR WrapperStruct00.var_1_19 [L85] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_19 [L87] WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L87] COND FALSE !(WrapperStruct00.var_1_16) [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR WrapperStruct00.var_1_2 [L135] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] EXPR (WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) [L135] EXPR WrapperStruct00.var_1_1 [L135] EXPR WrapperStruct00.var_1_6 [L135] EXPR (WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] EXPR ((WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_16 ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? (WrapperStruct00.var_1_7 == ((unsigned char) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15))) - WrapperStruct00.var_1_12))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] EXPR ((WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_16 ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? (WrapperStruct00.var_1_7 == ((unsigned char) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15))) - WrapperStruct00.var_1_12))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] EXPR (((WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_16 ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? (WrapperStruct00.var_1_7 == ((unsigned char) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15))) - WrapperStruct00.var_1_12))))) : 1)) && ((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_12) - (8 + WrapperStruct00.var_1_18)) > WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_16 == ((unsigned char) (! WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_19))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] EXPR (((WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_16 ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? (WrapperStruct00.var_1_7 == ((unsigned char) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15))) - WrapperStruct00.var_1_12))))) : 1)) && ((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_12) - (8 + WrapperStruct00.var_1_18)) > WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_16 == ((unsigned char) (! WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_19))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] EXPR ((((WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_16 ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? (WrapperStruct00.var_1_7 == ((unsigned char) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15))) - WrapperStruct00.var_1_12))))) : 1)) && ((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_12) - (8 + WrapperStruct00.var_1_18)) > WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_16 == ((unsigned char) (! WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_19)))) && (WrapperStruct00.var_1_20 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] EXPR ((((WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_16 ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? (WrapperStruct00.var_1_7 == ((unsigned char) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15))) - WrapperStruct00.var_1_12))))) : 1)) && ((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_12) - (8 + WrapperStruct00.var_1_18)) > WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_16 == ((unsigned char) (! WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_19)))) && (WrapperStruct00.var_1_20 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] EXPR (((((WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_16 ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? (WrapperStruct00.var_1_7 == ((unsigned char) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15))) - WrapperStruct00.var_1_12))))) : 1)) && ((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_12) - (8 + WrapperStruct00.var_1_18)) > WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_16 == ((unsigned char) (! WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_19)))) && (WrapperStruct00.var_1_20 == ((unsigned long int) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] EXPR (((((WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_16 ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? (WrapperStruct00.var_1_7 == ((unsigned char) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15))) - WrapperStruct00.var_1_12))))) : 1)) && ((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_12) - (8 + WrapperStruct00.var_1_18)) > WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_16 == ((unsigned char) (! WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_19)))) && (WrapperStruct00.var_1_20 == ((unsigned long int) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] EXPR ((((((WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_16 ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? (WrapperStruct00.var_1_7 == ((unsigned char) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15))) - WrapperStruct00.var_1_12))))) : 1)) && ((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_12) - (8 + WrapperStruct00.var_1_18)) > WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_16 == ((unsigned char) (! WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_19)))) && (WrapperStruct00.var_1_20 == ((unsigned long int) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_22 == ((unsigned char) 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] EXPR ((((((WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_16 ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? (WrapperStruct00.var_1_7 == ((unsigned char) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15))) - WrapperStruct00.var_1_12))))) : 1)) && ((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_12) - (8 + WrapperStruct00.var_1_18)) > WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_16 == ((unsigned char) (! WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_19)))) && (WrapperStruct00.var_1_20 == ((unsigned long int) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_22 == ((unsigned char) 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135-L136] return ((((((WrapperStruct00.var_1_2 <= WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_3 < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + 1.395f)) ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) : (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_16 ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? (WrapperStruct00.var_1_7 == ((unsigned char) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15))) - WrapperStruct00.var_1_12))))) : 1)) && ((((WrapperStruct00.var_1_17 - WrapperStruct00.var_1_12) - (8 + WrapperStruct00.var_1_18)) > WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_16 == ((unsigned char) (! WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_19)))) && (WrapperStruct00.var_1_20 == ((unsigned long int) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_22 == ((unsigned char) 4)) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2063 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1301 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 762 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=4, InterpolantAutomatonStates: 20, 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, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 978 NumberOfCodeBlocks, 978 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 810 ConstructedInterpolants, 0 QuantifiedInterpolants, 851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4200/4200 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-10-24 11:48:51,720 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-48.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 6af22983044ba27ae435cb0dcfcd33ee0fc69f0bc5638fc1b6ee52bc6b6af1dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:48:53,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:48:53,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:48:54,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:48:54,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:48:54,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:48:54,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:48:54,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:48:54,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:48:54,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:48:54,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:48:54,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:48:54,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:48:54,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:48:54,035 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:48:54,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:48:54,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:48:54,036 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:48:54,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:48:54,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:48:54,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:48:54,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:48:54,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:48:54,041 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:48:54,041 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:48:54,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:48:54,041 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:48:54,041 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:48:54,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:48:54,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:48:54,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:48:54,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:48:54,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:48:54,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:48:54,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:48:54,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:48:54,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:48:54,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:48:54,044 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:48:54,052 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:48:54,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:48:54,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:48:54,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:48:54,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:48:54,054 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:48:54,054 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 -> 6af22983044ba27ae435cb0dcfcd33ee0fc69f0bc5638fc1b6ee52bc6b6af1dd [2024-10-24 11:48:54,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:48:54,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:48:54,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:48:54,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:48:54,404 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:48:54,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-48.i [2024-10-24 11:48:55,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:48:56,159 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:48:56,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-48.i [2024-10-24 11:48:56,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c420c0eb/0d3387fb901f4230b8b613ba3ee5df31/FLAG79ec0e353 [2024-10-24 11:48:56,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c420c0eb/0d3387fb901f4230b8b613ba3ee5df31 [2024-10-24 11:48:56,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:48:56,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:48:56,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:48:56,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:48:56,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:48:56,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ed7c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56, skipping insertion in model container [2024-10-24 11:48:56,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:48:56,417 WARN L248 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-48.i[916,929] [2024-10-24 11:48:56,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:48:56,511 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:48:56,525 WARN L248 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-48.i[916,929] [2024-10-24 11:48:56,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:48:56,609 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:48:56,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56 WrapperNode [2024-10-24 11:48:56,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:48:56,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:48:56,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:48:56,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:48:56,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,688 INFO L138 Inliner]: procedures = 33, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-10-24 11:48:56,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:48:56,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:48:56,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:48:56,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:48:56,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,733 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 21 initializations are split as follows [2, 19]. The 23 writes are split as follows [0, 23]. [2024-10-24 11:48:56,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:48:56,795 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:48:56,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:48:56,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:48:56,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (1/1) ... [2024-10-24 11:48:56,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:48:56,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:48:56,837 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-10-24 11:48:56,841 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-10-24 11:48:56,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:48:56,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:48:56,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:48:56,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:48:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:48:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:48:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:48:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:48:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:48:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:48:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:48:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:48:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:48:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:48:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:48:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:48:56,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:48:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:48:56,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:48:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:48:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:48:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:48:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:48:57,050 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:48:57,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:48:58,505 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-24 11:48:58,505 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:48:58,572 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:48:58,573 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:48:58,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:58 BoogieIcfgContainer [2024-10-24 11:48:58,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:48:58,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:48:58,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:48:58,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:48:58,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:48:56" (1/3) ... [2024-10-24 11:48:58,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2b7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:48:58, skipping insertion in model container [2024-10-24 11:48:58,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:56" (2/3) ... [2024-10-24 11:48:58,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2b7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:48:58, skipping insertion in model container [2024-10-24 11:48:58,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:58" (3/3) ... [2024-10-24 11:48:58,587 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-48.i [2024-10-24 11:48:58,604 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:48:58,604 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:48:58,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:48:58,674 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;@5098923d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:48:58,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:48:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:48:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:48:58,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:58,696 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:58,697 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:58,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1485664768, now seen corresponding path program 1 times [2024-10-24 11:48:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:58,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297689022] [2024-10-24 11:48:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:58,715 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-10-24 11:48:58,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:58,719 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-10-24 11:48:58,720 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-10-24 11:48:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:48:59,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-10-24 11:48:59,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:59,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:59,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297689022] [2024-10-24 11:48:59,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297689022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:59,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:59,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:48:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174354895] [2024-10-24 11:48:59,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:59,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:48:59,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:48:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:48:59,206 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:48:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:59,269 INFO L93 Difference]: Finished difference Result 219 states and 351 transitions. [2024-10-24 11:48:59,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:48:59,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-24 11:48:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:59,280 INFO L225 Difference]: With dead ends: 219 [2024-10-24 11:48:59,280 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 11:48:59,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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-10-24 11:48:59,290 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 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-10-24 11:48:59,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 11:48:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-24 11:48:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:48:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-10-24 11:48:59,340 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 163 [2024-10-24 11:48:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:59,341 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-10-24 11:48:59,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:48:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-10-24 11:48:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:48:59,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:59,348 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:59,358 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-10-24 11:48:59,549 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-10-24 11:48:59,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:59,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash 267758622, now seen corresponding path program 1 times [2024-10-24 11:48:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:59,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425899501] [2024-10-24 11:48:59,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:59,552 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-10-24 11:48:59,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:59,555 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-10-24 11:48:59,556 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-10-24 11:48:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:48:59,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:48:59,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:59,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:59,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425899501] [2024-10-24 11:48:59,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425899501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:59,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:59,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:48:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75537304] [2024-10-24 11:48:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:59,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:48:59,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:59,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:48:59,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:48:59,943 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:49:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:00,047 INFO L93 Difference]: Finished difference Result 222 states and 324 transitions. [2024-10-24 11:49:00,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:49:00,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:49:00,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:00,050 INFO L225 Difference]: With dead ends: 222 [2024-10-24 11:49:00,050 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 11:49:00,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 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-10-24 11:49:00,054 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:00,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 590 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:49:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 11:49:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-24 11:49:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:49:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-10-24 11:49:00,076 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 163 [2024-10-24 11:49:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:00,078 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-10-24 11:49:00,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:49:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-10-24 11:49:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:49:00,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:00,081 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:00,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:00,282 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-10-24 11:49:00,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:00,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash -541588004, now seen corresponding path program 1 times [2024-10-24 11:49:00,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:00,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472951980] [2024-10-24 11:49:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:00,285 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-10-24 11:49:00,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:00,286 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-10-24 11:49:00,287 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-10-24 11:49:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:00,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:49:00,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:49:00,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:00,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:00,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472951980] [2024-10-24 11:49:00,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472951980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:00,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:00,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:49:00,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083632163] [2024-10-24 11:49:00,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:00,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:49:00,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:00,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:49:00,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:49:00,643 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:49:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:00,725 INFO L93 Difference]: Finished difference Result 228 states and 329 transitions. [2024-10-24 11:49:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:49:00,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:49:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:00,728 INFO L225 Difference]: With dead ends: 228 [2024-10-24 11:49:00,728 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:49:00,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:49:00,730 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:00,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 728 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:49:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:49:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-24 11:49:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:49:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-10-24 11:49:00,740 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 163 [2024-10-24 11:49:00,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:00,741 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-10-24 11:49:00,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:49:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-10-24 11:49:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:49:00,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:00,744 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:00,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:49:00,944 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-10-24 11:49:00,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:00,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:00,945 INFO L85 PathProgramCache]: Analyzing trace with hash -484329702, now seen corresponding path program 1 times [2024-10-24 11:49:00,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:00,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092797374] [2024-10-24 11:49:00,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:00,947 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-10-24 11:49:00,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:00,950 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-10-24 11:49:00,951 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-10-24 11:49:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:49:01,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:49:01,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:01,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:01,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092797374] [2024-10-24 11:49:01,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092797374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:01,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:01,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:49:01,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558536799] [2024-10-24 11:49:01,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:01,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:49:01,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:01,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:49:01,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:49:01,325 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:49:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:01,431 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-10-24 11:49:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:49:01,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-24 11:49:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:01,436 INFO L225 Difference]: With dead ends: 232 [2024-10-24 11:49:01,437 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 11:49:01,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 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-10-24 11:49:01,440 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:01,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 868 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:49:01,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 11:49:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-24 11:49:01,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:49:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2024-10-24 11:49:01,454 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 163 [2024-10-24 11:49:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:01,455 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2024-10-24 11:49:01,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:49:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2024-10-24 11:49:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 11:49:01,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:01,460 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:01,470 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 (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:01,660 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-10-24 11:49:01,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:01,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash -484270120, now seen corresponding path program 1 times [2024-10-24 11:49:01,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:01,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342084590] [2024-10-24 11:49:01,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:01,663 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-10-24 11:49:01,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:01,666 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-10-24 11:49:01,667 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-10-24 11:49:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:01,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:49:01,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:02,106 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-10-24 11:49:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-10-24 11:49:02,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:02,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342084590] [2024-10-24 11:49:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342084590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:02,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:49:02,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225121160] [2024-10-24 11:49:02,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:02,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:49:02,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:02,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:49:02,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:49:02,148 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:49:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:03,371 INFO L93 Difference]: Finished difference Result 234 states and 334 transitions. [2024-10-24 11:49:03,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:49:03,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-24 11:49:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:03,375 INFO L225 Difference]: With dead ends: 234 [2024-10-24 11:49:03,375 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 11:49:03,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 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-10-24 11:49:03,377 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 141 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:03,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 436 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 11:49:03,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 11:49:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-24 11:49:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:49:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-10-24 11:49:03,386 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 163 [2024-10-24 11:49:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:03,386 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-10-24 11:49:03,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:49:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-10-24 11:49:03,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 11:49:03,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:03,389 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:03,400 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-10-24 11:49:03,589 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-10-24 11:49:03,590 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:03,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2002427934, now seen corresponding path program 1 times [2024-10-24 11:49:03,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:03,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557308707] [2024-10-24 11:49:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:03,591 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-10-24 11:49:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:03,594 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-10-24 11:49:03,595 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-10-24 11:49:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:03,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:49:03,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:03,997 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-10-24 11:49:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-10-24 11:49:04,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:04,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:04,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557308707] [2024-10-24 11:49:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557308707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:04,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:04,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:49:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945641949] [2024-10-24 11:49:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:04,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:49:04,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:49:04,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:49:04,033 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:49:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:05,459 INFO L93 Difference]: Finished difference Result 234 states and 332 transitions. [2024-10-24 11:49:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:49:05,460 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), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 165 [2024-10-24 11:49:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:05,461 INFO L225 Difference]: With dead ends: 234 [2024-10-24 11:49:05,461 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 11:49:05,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 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-10-24 11:49:05,462 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 133 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:05,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 434 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 11:49:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 11:49:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-24 11:49:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:49:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2024-10-24 11:49:05,470 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 165 [2024-10-24 11:49:05,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:05,471 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2024-10-24 11:49:05,471 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), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:49:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2024-10-24 11:49:05,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 11:49:05,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:05,476 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:05,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 11:49:05,676 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-10-24 11:49:05,677 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:05,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:05,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1570167704, now seen corresponding path program 1 times [2024-10-24 11:49:05,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:05,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138152884] [2024-10-24 11:49:05,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:05,678 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-10-24 11:49:05,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:05,679 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-10-24 11:49:05,680 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-10-24 11:49:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 11:49:06,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:06,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:49:06,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2024-10-24 11:49:06,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 19 [2024-10-24 11:49:06,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 51 [2024-10-24 11:49:06,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:06,580 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 42 treesize of output 18 [2024-10-24 11:49:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-10-24 11:49:06,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:06,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:06,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138152884] [2024-10-24 11:49:06,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138152884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:06,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:06,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:49:06,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853803486] [2024-10-24 11:49:06,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:06,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:49:06,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:06,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:49:06,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:49:06,610 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-24 11:49:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:10,270 INFO L93 Difference]: Finished difference Result 351 states and 489 transitions. [2024-10-24 11:49:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:49:10,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 167 [2024-10-24 11:49:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:10,272 INFO L225 Difference]: With dead ends: 351 [2024-10-24 11:49:10,272 INFO L226 Difference]: Without dead ends: 235 [2024-10-24 11:49:10,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:49:10,273 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 361 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:10,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 417 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-24 11:49:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-24 11:49:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 123. [2024-10-24 11:49:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:49:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2024-10-24 11:49:10,301 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 167 [2024-10-24 11:49:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:10,301 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2024-10-24 11:49:10,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-24 11:49:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2024-10-24 11:49:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 11:49:10,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:10,305 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:10,320 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 (8)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:10,506 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-10-24 11:49:10,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:10,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash -423977002, now seen corresponding path program 1 times [2024-10-24 11:49:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:10,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056043867] [2024-10-24 11:49:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:10,509 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-10-24 11:49:10,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:10,513 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-10-24 11:49:10,514 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-10-24 11:49:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:10,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-24 11:49:10,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:11,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:49:11,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-10-24 11:49:11,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:11,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2024-10-24 11:49:11,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:11,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 70 [2024-10-24 11:49:12,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:12,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 83 [2024-10-24 11:49:12,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:12,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 86 [2024-10-24 11:49:12,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:12,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 86 [2024-10-24 11:49:13,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:13,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 115 treesize of output 96 [2024-10-24 11:49:13,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:13,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 99 [2024-10-24 11:49:13,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:13,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 171 treesize of output 126 [2024-10-24 11:49:14,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:14,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 197 treesize of output 121 [2024-10-24 11:49:14,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:14,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 177 treesize of output 141 [2024-10-24 11:49:14,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:14,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 273 treesize of output 105 [2024-10-24 11:49:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 448 proven. 272 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 11:49:14,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:14,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056043867] [2024-10-24 11:49:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056043867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:49:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1401266125] [2024-10-24 11:49:14,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:14,702 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:49:14,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:49:14,705 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:49:14,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-24 11:49:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:16,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-24 11:49:16,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:16,162 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 25 treesize of output 13 [2024-10-24 11:49:16,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:49:17,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2024-10-24 11:49:17,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:17,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 43 [2024-10-24 11:49:17,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:17,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 43 [2024-10-24 11:49:17,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:17,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 51 [2024-10-24 11:49:17,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:17,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 62 [2024-10-24 11:49:18,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:18,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 73 [2024-10-24 11:49:18,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:18,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 76 [2024-10-24 11:49:18,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:18,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 84 [2024-10-24 11:49:19,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:19,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 143 treesize of output 114 [2024-10-24 11:49:19,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:19,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 45 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 157 treesize of output 109 [2024-10-24 11:49:19,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:19,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 145 treesize of output 118 [2024-10-24 11:49:19,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:19,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 229 treesize of output 105 [2024-10-24 11:49:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 448 proven. 272 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 11:49:19,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:20,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1401266125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:49:20,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:49:20,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-10-24 11:49:20,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442314335] [2024-10-24 11:49:20,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:49:20,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 11:49:20,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:20,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 11:49:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2024-10-24 11:49:20,007 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 28 states, 28 states have (on average 5.464285714285714) internal successors, (153), 27 states have internal predecessors, (153), 14 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 14 states have call predecessors, (42), 14 states have call successors, (42) [2024-10-24 11:49:26,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:49:32,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:49:36,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:49:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:38,352 INFO L93 Difference]: Finished difference Result 471 states and 628 transitions. [2024-10-24 11:49:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 11:49:38,353 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.464285714285714) internal successors, (153), 27 states have internal predecessors, (153), 14 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 14 states have call predecessors, (42), 14 states have call successors, (42) Word has length 167 [2024-10-24 11:49:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:38,355 INFO L225 Difference]: With dead ends: 471 [2024-10-24 11:49:38,355 INFO L226 Difference]: Without dead ends: 349 [2024-10-24 11:49:38,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=531, Invalid=1821, Unknown=0, NotChecked=0, Total=2352 [2024-10-24 11:49:38,357 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 903 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:38,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1128 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 16.6s Time] [2024-10-24 11:49:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-24 11:49:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 273. [2024-10-24 11:49:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 218 states have (on average 1.2568807339449541) internal successors, (274), 219 states have internal predecessors, (274), 42 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:49:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 358 transitions. [2024-10-24 11:49:38,397 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 358 transitions. Word has length 167 [2024-10-24 11:49:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:38,398 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 358 transitions. [2024-10-24 11:49:38,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.464285714285714) internal successors, (153), 27 states have internal predecessors, (153), 14 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 14 states have call predecessors, (42), 14 states have call successors, (42) [2024-10-24 11:49:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 358 transitions. [2024-10-24 11:49:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 11:49:38,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:38,400 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:38,414 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-10-24 11:49:38,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-10-24 11:49:38,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 11:49:38,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:38,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1130573608, now seen corresponding path program 1 times [2024-10-24 11:49:38,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:38,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307083917] [2024-10-24 11:49:38,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:38,807 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-10-24 11:49:38,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:38,810 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-10-24 11:49:38,811 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-10-24 11:49:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:39,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:49:39,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-10-24 11:49:39,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:39,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:39,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307083917] [2024-10-24 11:49:39,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307083917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:39,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:39,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:49:39,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915388384] [2024-10-24 11:49:39,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:39,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:49:39,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:39,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:49:39,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:49:39,066 INFO L87 Difference]: Start difference. First operand 273 states and 358 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:49:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:39,151 INFO L93 Difference]: Finished difference Result 545 states and 715 transitions. [2024-10-24 11:49:39,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:49:39,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 167 [2024-10-24 11:49:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:39,157 INFO L225 Difference]: With dead ends: 545 [2024-10-24 11:49:39,157 INFO L226 Difference]: Without dead ends: 273 [2024-10-24 11:49:39,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 164 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-10-24 11:49:39,159 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 449 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:39,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:49:39,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-24 11:49:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-10-24 11:49:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 218 states have (on average 1.2522935779816513) internal successors, (273), 219 states have internal predecessors, (273), 42 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:49:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 357 transitions. [2024-10-24 11:49:39,197 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 357 transitions. Word has length 167 [2024-10-24 11:49:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:39,199 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 357 transitions. [2024-10-24 11:49:39,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:49:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 357 transitions. [2024-10-24 11:49:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 11:49:39,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:39,200 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:39,214 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-10-24 11:49:39,401 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-10-24 11:49:39,401 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:39,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:39,402 INFO L85 PathProgramCache]: Analyzing trace with hash 837234523, now seen corresponding path program 1 times [2024-10-24 11:49:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:39,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182373156] [2024-10-24 11:49:39,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:39,403 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-10-24 11:49:39,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:39,406 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-10-24 11:49:39,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 11:49:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:39,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-24 11:49:39,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:39,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:49:40,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-24 11:49:40,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:40,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2024-10-24 11:49:40,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:40,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2024-10-24 11:49:40,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:40,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2024-10-24 11:49:40,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:40,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2024-10-24 11:49:41,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:41,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2024-10-24 11:49:41,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:41,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2024-10-24 11:49:41,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:41,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2024-10-24 11:49:41,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:41,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 77 [2024-10-24 11:49:41,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:41,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 90 [2024-10-24 11:49:42,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:42,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 103 [2024-10-24 11:49:42,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:42,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 165 treesize of output 116 [2024-10-24 11:49:43,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:43,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 228 treesize of output 135 [2024-10-24 11:49:43,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:43,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 194 treesize of output 111 [2024-10-24 11:49:43,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:43,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 174 treesize of output 122 [2024-10-24 11:49:43,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:43,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 224 treesize of output 80 [2024-10-24 11:49:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 480 proven. 80 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-24 11:49:43,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:49:44,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182373156] [2024-10-24 11:49:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182373156] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:49:44,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:49:44,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-10-24 11:49:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633639654] [2024-10-24 11:49:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:44,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:49:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:44,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:49:44,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:49:44,078 INFO L87 Difference]: Start difference. First operand 273 states and 357 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:49:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:45,308 INFO L93 Difference]: Finished difference Result 627 states and 819 transitions. [2024-10-24 11:49:45,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:49:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 169 [2024-10-24 11:49:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:45,312 INFO L225 Difference]: With dead ends: 627 [2024-10-24 11:49:45,312 INFO L226 Difference]: Without dead ends: 355 [2024-10-24 11:49:45,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:49:45,313 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 74 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:45,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 351 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 11:49:45,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-24 11:49:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 295. [2024-10-24 11:49:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 240 states have (on average 1.2541666666666667) internal successors, (301), 241 states have internal predecessors, (301), 42 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:49:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 385 transitions. [2024-10-24 11:49:45,346 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 385 transitions. Word has length 169 [2024-10-24 11:49:45,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:45,346 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 385 transitions. [2024-10-24 11:49:45,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:49:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 385 transitions. [2024-10-24 11:49:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 11:49:45,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:45,348 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:45,361 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 (12)] Ended with exit code 0 [2024-10-24 11:49:45,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:49:45,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:45,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:45,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1949100565, now seen corresponding path program 1 times [2024-10-24 11:49:45,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:45,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931799121] [2024-10-24 11:49:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:45,551 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-10-24 11:49:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:45,554 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:49:45,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 11:49:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:45,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:49:45,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:49:45,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:45,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931799121] [2024-10-24 11:49:45,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931799121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:45,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:45,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:49:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724664331] [2024-10-24 11:49:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:45,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:49:45,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:49:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:49:45,831 INFO L87 Difference]: Start difference. First operand 295 states and 385 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:49:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:45,899 INFO L93 Difference]: Finished difference Result 595 states and 777 transitions. [2024-10-24 11:49:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:49:45,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 169 [2024-10-24 11:49:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:45,901 INFO L225 Difference]: With dead ends: 595 [2024-10-24 11:49:45,901 INFO L226 Difference]: Without dead ends: 301 [2024-10-24 11:49:45,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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-10-24 11:49:45,903 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:45,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 589 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:49:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-24 11:49:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-10-24 11:49:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 246 states have (on average 1.2479674796747968) internal successors, (307), 247 states have internal predecessors, (307), 42 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:49:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 391 transitions. [2024-10-24 11:49:45,934 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 391 transitions. Word has length 169 [2024-10-24 11:49:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:45,936 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 391 transitions. [2024-10-24 11:49:45,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:49:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 391 transitions. [2024-10-24 11:49:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 11:49:45,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:45,940 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:45,951 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 (13)] Ended with exit code 0 [2024-10-24 11:49:46,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-10-24 11:49:46,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:46,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1653917478, now seen corresponding path program 1 times [2024-10-24 11:49:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:46,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285031743] [2024-10-24 11:49:46,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:46,142 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-10-24 11:49:46,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:46,143 INFO L229 MonitoredProcess]: Starting monitored process 14 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-10-24 11:49:46,144 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 (14)] Waiting until timeout for monitored process [2024-10-24 11:49:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:46,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:49:46,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-10-24 11:49:46,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:46,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:46,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285031743] [2024-10-24 11:49:46,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285031743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:46,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:46,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:49:46,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655260843] [2024-10-24 11:49:46,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:46,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:49:46,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:46,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:49:46,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:49:46,421 INFO L87 Difference]: Start difference. First operand 301 states and 391 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-24 11:49:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:46,585 INFO L93 Difference]: Finished difference Result 617 states and 798 transitions. [2024-10-24 11:49:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:49:46,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 169 [2024-10-24 11:49:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:46,588 INFO L225 Difference]: With dead ends: 617 [2024-10-24 11:49:46,588 INFO L226 Difference]: Without dead ends: 315 [2024-10-24 11:49:46,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:49:46,592 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:46,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 600 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:49:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-24 11:49:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 301. [2024-10-24 11:49:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 246 states have (on average 1.2439024390243902) internal successors, (306), 247 states have internal predecessors, (306), 42 states have call successors, (42), 12 states have call predecessors, (42), 12 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:49:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 390 transitions. [2024-10-24 11:49:46,631 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 390 transitions. Word has length 169 [2024-10-24 11:49:46,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:46,631 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 390 transitions. [2024-10-24 11:49:46,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-24 11:49:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 390 transitions. [2024-10-24 11:49:46,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 11:49:46,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:46,633 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:46,644 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 (14)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:46,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-10-24 11:49:46,834 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:46,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1694011932, now seen corresponding path program 1 times [2024-10-24 11:49:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:46,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31378864] [2024-10-24 11:49:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:46,835 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-10-24 11:49:46,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:46,837 INFO L229 MonitoredProcess]: Starting monitored process 15 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-10-24 11:49:46,839 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 (15)] Waiting until timeout for monitored process [2024-10-24 11:49:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:47,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-24 11:49:47,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:47,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:49:47,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 42 [2024-10-24 11:49:47,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:47,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 55 [2024-10-24 11:49:47,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:47,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 58 [2024-10-24 11:49:47,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:47,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 58 [2024-10-24 11:49:48,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:48,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 68 [2024-10-24 11:49:48,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:48,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 71 [2024-10-24 11:49:48,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:48,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 81 [2024-10-24 11:49:48,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:48,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 94 [2024-10-24 11:49:49,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:49,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 169 treesize of output 124 [2024-10-24 11:49:49,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:49,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 195 treesize of output 119 [2024-10-24 11:49:49,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:49,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 175 treesize of output 130 [2024-10-24 11:49:49,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:49,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 266 treesize of output 104 [2024-10-24 11:49:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 400 proven. 320 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 11:49:49,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:49,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:49,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31378864] [2024-10-24 11:49:49,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31378864] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:49:49,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [81813021] [2024-10-24 11:49:49,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:49,787 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:49:49,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:49:49,789 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:49:49,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-10-24 11:49:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:51,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-24 11:49:51,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:51,290 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 25 treesize of output 13 [2024-10-24 11:49:51,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:49:52,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-10-24 11:49:52,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-10-24 11:49:52,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-10-24 11:49:52,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 38 [2024-10-24 11:49:52,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:52,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2024-10-24 11:49:52,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:52,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 60 [2024-10-24 11:49:53,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:53,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 71 [2024-10-24 11:49:53,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:53,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 94 treesize of output 74 [2024-10-24 11:49:53,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:53,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 101 [2024-10-24 11:49:53,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:53,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 36 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 147 treesize of output 96 [2024-10-24 11:49:53,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:53,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 135 treesize of output 112 [2024-10-24 11:49:54,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:54,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 219 treesize of output 99 [2024-10-24 11:49:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 400 proven. 320 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 11:49:54,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [81813021] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:49:54,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:49:54,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2024-10-24 11:49:54,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002459014] [2024-10-24 11:49:54,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:49:54,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-24 11:49:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:54,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-24 11:49:54,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 11:49:54,268 INFO L87 Difference]: Start difference. First operand 301 states and 390 transitions. Second operand has 33 states, 31 states have (on average 5.064516129032258) internal successors, (157), 29 states have internal predecessors, (157), 14 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 13 states have call predecessors, (42), 14 states have call successors, (42)