./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-9.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-9.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 68b0cda5422c6df9a05dd00f43cb56ae62ac5ef3a6cb82099875e56a3f490744 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:53:38,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:53:38,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:53:38,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:53:38,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:53:38,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:53:38,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:53:38,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:53:38,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:53:38,292 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:53:38,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:53:38,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:53:38,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:53:38,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:53:38,293 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:53:38,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:53:38,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:53:38,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:53:38,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:53:38,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:53:38,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:53:38,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:53:38,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:53:38,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:53:38,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:53:38,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:53:38,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:53:38,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:53:38,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:53:38,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:53:38,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:53:38,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:53:38,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:53:38,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:53:38,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:53:38,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:53:38,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:53:38,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:53:38,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:53:38,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:53:38,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:53:38,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:53:38,303 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 -> 68b0cda5422c6df9a05dd00f43cb56ae62ac5ef3a6cb82099875e56a3f490744 [2024-10-24 11:53:38,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:53:38,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:53:38,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:53:38,520 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:53:38,521 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:53:38,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i [2024-10-24 11:53:39,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:53:39,876 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:53:39,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i [2024-10-24 11:53:39,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e00bbe8/403bad6aecfc4ffd9b085e90c5436c4b/FLAG8bdc9d91c [2024-10-24 11:53:39,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e00bbe8/403bad6aecfc4ffd9b085e90c5436c4b [2024-10-24 11:53:39,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:53:39,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:53:39,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:53:39,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:53:39,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:53:39,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:39" (1/1) ... [2024-10-24 11:53:39,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4bd49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:39, skipping insertion in model container [2024-10-24 11:53:39,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:39" (1/1) ... [2024-10-24 11:53:39,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:53:40,110 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-9.i[915,928] [2024-10-24 11:53:40,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:53:40,179 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:53:40,190 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-9.i[915,928] [2024-10-24 11:53:40,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:53:40,228 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:53:40,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40 WrapperNode [2024-10-24 11:53:40,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:53:40,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:53:40,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:53:40,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:53:40,234 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:53:40" (1/1) ... [2024-10-24 11:53:40,245 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:53:40" (1/1) ... [2024-10-24 11:53:40,270 INFO L138 Inliner]: procedures = 29, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 342 [2024-10-24 11:53:40,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:53:40,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:53:40,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:53:40,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:53:40,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40" (1/1) ... [2024-10-24 11:53:40,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40" (1/1) ... [2024-10-24 11:53:40,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40" (1/1) ... [2024-10-24 11:53:40,298 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-10-24 11:53:40,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40" (1/1) ... [2024-10-24 11:53:40,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40" (1/1) ... [2024-10-24 11:53:40,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40" (1/1) ... [2024-10-24 11:53:40,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40" (1/1) ... [2024-10-24 11:53:40,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40" (1/1) ... [2024-10-24 11:53:40,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40" (1/1) ... [2024-10-24 11:53:40,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:53:40,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:53:40,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:53:40,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:53:40,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40" (1/1) ... [2024-10-24 11:53:40,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:53:40,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:53:40,354 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:53:40,356 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:53:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:53:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:53:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:53:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:53:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:53:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:53:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:53:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:53:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:53:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:53:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:53:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:53:40,400 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:53:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:53:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:53:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:53:40,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:53:40,501 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:53:40,508 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:53:40,800 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-10-24 11:53:40,801 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:53:40,830 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:53:40,834 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:53:40,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:40 BoogieIcfgContainer [2024-10-24 11:53:40,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:53:40,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:53:40,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:53:40,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:53:40,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:53:39" (1/3) ... [2024-10-24 11:53:40,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4822e742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:40, skipping insertion in model container [2024-10-24 11:53:40,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:40" (2/3) ... [2024-10-24 11:53:40,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4822e742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:40, skipping insertion in model container [2024-10-24 11:53:40,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:40" (3/3) ... [2024-10-24 11:53:40,842 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-9.i [2024-10-24 11:53:40,855 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:53:40,855 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:53:40,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:53:40,907 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;@2935c558, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:53:40,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:53:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 11:53:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:53:40,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:40,917 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:40,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:40,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1812120356, now seen corresponding path program 1 times [2024-10-24 11:53:40,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:40,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856138348] [2024-10-24 11:53:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:40,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:53:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:53:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:53:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:53:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:53:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856138348] [2024-10-24 11:53:41,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856138348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:41,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:41,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:53:41,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398300995] [2024-10-24 11:53:41,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:41,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:53:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:41,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:53:41,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:53:41,146 INFO L87 Difference]: Start difference. First operand has 69 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:53:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:41,176 INFO L93 Difference]: Finished difference Result 135 states and 203 transitions. [2024-10-24 11:53:41,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:53:41,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-10-24 11:53:41,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:41,184 INFO L225 Difference]: With dead ends: 135 [2024-10-24 11:53:41,184 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 11:53:41,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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:53:41,191 INFO L432 NwaCegarLoop]: 91 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, 91 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:53:41,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:53:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 11:53:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-24 11:53:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 11:53:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2024-10-24 11:53:41,231 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 57 [2024-10-24 11:53:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:41,231 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2024-10-24 11:53:41,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:53:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2024-10-24 11:53:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:53:41,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:41,233 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:41,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:53:41,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:41,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:41,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1544613482, now seen corresponding path program 1 times [2024-10-24 11:53:41,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:41,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724154899] [2024-10-24 11:53:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:41,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:53:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:53:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:53:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:53:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:53:41,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:41,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724154899] [2024-10-24 11:53:41,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724154899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:41,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:41,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:53:41,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499664092] [2024-10-24 11:53:41,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:41,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:53:41,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:41,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:53:41,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:53:41,463 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:41,499 INFO L93 Difference]: Finished difference Result 136 states and 193 transitions. [2024-10-24 11:53:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:53:41,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-24 11:53:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:41,500 INFO L225 Difference]: With dead ends: 136 [2024-10-24 11:53:41,500 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 11:53:41,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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:53:41,502 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 257 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:53:41,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 257 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:53:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 11:53:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-24 11:53:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 11:53:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-10-24 11:53:41,508 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 57 [2024-10-24 11:53:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:41,510 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-10-24 11:53:41,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-10-24 11:53:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:53:41,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:41,512 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:41,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:53:41,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:41,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1151586472, now seen corresponding path program 1 times [2024-10-24 11:53:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:41,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9844473] [2024-10-24 11:53:41,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:53:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:53:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:53:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:53:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:53:41,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:41,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9844473] [2024-10-24 11:53:41,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9844473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:41,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:41,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:53:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541413973] [2024-10-24 11:53:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:41,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:53:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:53:41,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:53:41,649 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:41,677 INFO L93 Difference]: Finished difference Result 140 states and 197 transitions. [2024-10-24 11:53:41,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:53:41,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-24 11:53:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:41,679 INFO L225 Difference]: With dead ends: 140 [2024-10-24 11:53:41,679 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 11:53:41,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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:53:41,680 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 258 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:53:41,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 258 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:53:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 11:53:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-24 11:53:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 11:53:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-10-24 11:53:41,686 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 57 [2024-10-24 11:53:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:41,686 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-10-24 11:53:41,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-10-24 11:53:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:53:41,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:41,687 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:41,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:53:41,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:41,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash 342239846, now seen corresponding path program 1 times [2024-10-24 11:53:41,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:41,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533777933] [2024-10-24 11:53:41,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:41,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:53:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:53:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:53:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:53:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:53:41,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:41,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533777933] [2024-10-24 11:53:41,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533777933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:41,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:41,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:53:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870636748] [2024-10-24 11:53:41,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:41,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:53:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:41,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:53:41,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:53:41,977 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:53:42,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:42,241 INFO L93 Difference]: Finished difference Result 259 states and 362 transitions. [2024-10-24 11:53:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:53:42,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-10-24 11:53:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:42,243 INFO L225 Difference]: With dead ends: 259 [2024-10-24 11:53:42,245 INFO L226 Difference]: Without dead ends: 189 [2024-10-24 11:53:42,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:53:42,246 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 286 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:42,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 301 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:53:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-24 11:53:42,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 137. [2024-10-24 11:53:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 124 states have (on average 1.3870967741935485) internal successors, (172), 124 states have internal predecessors, (172), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:53:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2024-10-24 11:53:42,265 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 57 [2024-10-24 11:53:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:42,265 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2024-10-24 11:53:42,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:53:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2024-10-24 11:53:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 11:53:42,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:42,269 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:42,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:53:42,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:42,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1379541321, now seen corresponding path program 1 times [2024-10-24 11:53:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011254296] [2024-10-24 11:53:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:42,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:53:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:53:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:42,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:53:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:42,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:53:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:42,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:53:42,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:42,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011254296] [2024-10-24 11:53:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011254296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:53:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561164870] [2024-10-24 11:53:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:42,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:53:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:42,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:53:42,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:53:42,339 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:42,377 INFO L93 Difference]: Finished difference Result 279 states and 391 transitions. [2024-10-24 11:53:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:53:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2024-10-24 11:53:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:42,379 INFO L225 Difference]: With dead ends: 279 [2024-10-24 11:53:42,381 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 11:53:42,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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:53:42,383 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:42,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 260 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:53:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 11:53:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-10-24 11:53:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.375) internal successors, (176), 128 states have internal predecessors, (176), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:53:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 196 transitions. [2024-10-24 11:53:42,404 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 196 transitions. Word has length 58 [2024-10-24 11:53:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:42,404 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 196 transitions. [2024-10-24 11:53:42,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2024-10-24 11:53:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 11:53:42,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:42,405 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:42,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:53:42,406 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:42,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1379481739, now seen corresponding path program 1 times [2024-10-24 11:53:42,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:42,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750554469] [2024-10-24 11:53:42,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:42,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:42,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:53:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:42,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:53:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:53:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:53:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:53:43,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:43,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750554469] [2024-10-24 11:53:43,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750554469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:43,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:43,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:53:43,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184362379] [2024-10-24 11:53:43,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:43,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:53:43,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:43,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:53:43,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:53:43,011 INFO L87 Difference]: Start difference. First operand 141 states and 196 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:53:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:43,134 INFO L93 Difference]: Finished difference Result 286 states and 398 transitions. [2024-10-24 11:53:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:53:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-10-24 11:53:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:43,135 INFO L225 Difference]: With dead ends: 286 [2024-10-24 11:53:43,135 INFO L226 Difference]: Without dead ends: 146 [2024-10-24 11:53:43,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:53:43,137 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 46 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:43,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 272 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:53:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-24 11:53:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-10-24 11:53:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:53:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2024-10-24 11:53:43,151 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 58 [2024-10-24 11:53:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:43,151 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2024-10-24 11:53:43,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:53:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2024-10-24 11:53:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 11:53:43,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:43,152 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:43,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:53:43,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:43,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:43,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2058667265, now seen corresponding path program 1 times [2024-10-24 11:53:43,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:43,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402861458] [2024-10-24 11:53:43,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:43,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:53:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:53:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:53:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:53:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:53:43,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:43,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402861458] [2024-10-24 11:53:43,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402861458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:43,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:43,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:53:43,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076327286] [2024-10-24 11:53:43,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:43,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:53:43,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:43,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:53:43,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:53:43,443 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:53:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:43,621 INFO L93 Difference]: Finished difference Result 345 states and 474 transitions. [2024-10-24 11:53:43,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:53:43,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-24 11:53:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:43,623 INFO L225 Difference]: With dead ends: 345 [2024-10-24 11:53:43,625 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 11:53:43,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:53:43,626 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 412 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:43,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 219 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:53:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 11:53:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 145. [2024-10-24 11:53:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.356060606060606) internal successors, (179), 132 states have internal predecessors, (179), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:53:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 199 transitions. [2024-10-24 11:53:43,640 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 199 transitions. Word has length 62 [2024-10-24 11:53:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:43,640 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 199 transitions. [2024-10-24 11:53:43,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:53:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 199 transitions. [2024-10-24 11:53:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 11:53:43,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:43,642 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:43,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:53:43,643 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:43,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:43,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1166507603, now seen corresponding path program 1 times [2024-10-24 11:53:43,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:43,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554860501] [2024-10-24 11:53:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:43,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:53:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:53:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:53:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:53:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:53:43,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:43,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554860501] [2024-10-24 11:53:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554860501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:43,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:43,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:53:43,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494225884] [2024-10-24 11:53:43,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:43,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:53:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:53:43,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:53:43,884 INFO L87 Difference]: Start difference. First operand 145 states and 199 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:44,051 INFO L93 Difference]: Finished difference Result 335 states and 458 transitions. [2024-10-24 11:53:44,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:53:44,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-10-24 11:53:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:44,052 INFO L225 Difference]: With dead ends: 335 [2024-10-24 11:53:44,053 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 11:53:44,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:53:44,054 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 180 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:44,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 237 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:53:44,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 11:53:44,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 135. [2024-10-24 11:53:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:53:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 184 transitions. [2024-10-24 11:53:44,067 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 184 transitions. Word has length 62 [2024-10-24 11:53:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:44,067 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 184 transitions. [2024-10-24 11:53:44,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 184 transitions. [2024-10-24 11:53:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 11:53:44,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:44,068 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:44,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:53:44,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:44,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1880683933, now seen corresponding path program 1 times [2024-10-24 11:53:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:44,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234683342] [2024-10-24 11:53:44,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:44,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:53:44,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508642085] [2024-10-24 11:53:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:44,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:53:44,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:53:44,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:53:44,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:53:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:53:44,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:53:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:53:44,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:53:44,469 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:53:44,470 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:53:44,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:53:44,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:53:44,679 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:44,721 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:53:44,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:53:44 BoogieIcfgContainer [2024-10-24 11:53:44,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:53:44,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:53:44,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:53:44,724 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:53:44,724 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:40" (3/4) ... [2024-10-24 11:53:44,726 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:53:44,727 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:53:44,728 INFO L158 Benchmark]: Toolchain (without parser) took 4825.12ms. Allocated memory was 161.5MB in the beginning and 228.6MB in the end (delta: 67.1MB). Free memory was 95.0MB in the beginning and 168.4MB in the end (delta: -73.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:53:44,728 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 102.8MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:53:44,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.11ms. Allocated memory is still 161.5MB. Free memory was 94.7MB in the beginning and 129.1MB in the end (delta: -34.4MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-10-24 11:53:44,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.44ms. Allocated memory is still 161.5MB. Free memory was 128.5MB in the beginning and 125.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:53:44,728 INFO L158 Benchmark]: Boogie Preprocessor took 52.04ms. Allocated memory is still 161.5MB. Free memory was 125.6MB in the beginning and 121.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:53:44,729 INFO L158 Benchmark]: RCFGBuilder took 510.71ms. Allocated memory is still 161.5MB. Free memory was 121.4MB in the beginning and 92.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 11:53:44,729 INFO L158 Benchmark]: TraceAbstraction took 3887.77ms. Allocated memory was 161.5MB in the beginning and 228.6MB in the end (delta: 67.1MB). Free memory was 91.4MB in the beginning and 168.4MB in the end (delta: -77.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:53:44,729 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 228.6MB. Free memory was 168.4MB in the beginning and 168.4MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:53:44,730 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.13ms. Allocated memory is still 102.8MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.11ms. Allocated memory is still 161.5MB. Free memory was 94.7MB in the beginning and 129.1MB in the end (delta: -34.4MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.44ms. Allocated memory is still 161.5MB. Free memory was 128.5MB in the beginning and 125.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.04ms. Allocated memory is still 161.5MB. Free memory was 125.6MB in the beginning and 121.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 510.71ms. Allocated memory is still 161.5MB. Free memory was 121.4MB in the beginning and 92.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3887.77ms. Allocated memory was 161.5MB in the beginning and 228.6MB in the end (delta: 67.1MB). Free memory was 91.4MB in the beginning and 168.4MB in the end (delta: -77.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 228.6MB. Free memory was 168.4MB in the beginning and 168.4MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. 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 someBinaryDOUBLEComparisonOperation at line 95, overapproximation of shiftLeft at line 95. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L45] unsigned char last_1_WrapperStruct0_var_1_1 = 10; [L46] double last_1_WrapperStruct0_var_1_10 = 9.2; [L47] signed short int last_1_WrapperStruct0_var_1_12 = 1; [L48] signed long int last_1_WrapperStruct0_var_1_14 = -16; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L89] EXPR WrapperStruct0.var_1_1 [L89] last_1_WrapperStruct0_var_1_1 = WrapperStruct0.var_1_1 [L90] EXPR WrapperStruct0.var_1_10 [L90] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L91] EXPR WrapperStruct0.var_1_12 [L91] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L92] EXPR WrapperStruct0.var_1_14 [L92] last_1_WrapperStruct0_var_1_14 = WrapperStruct0.var_1_14 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L79] WrapperStruct0.var_1_3 = __VERIFIER_nondet_uchar() [L80] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L80] CALL assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L80] RET assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L81] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L81] CALL assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L81] RET assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L82] WrapperStruct0.var_1_7 = __VERIFIER_nondet_uchar() [L83] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L83] CALL assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L83] RET assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L84] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L84] CALL assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L84] RET assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L85] WrapperStruct0.var_1_11 = __VERIFIER_nondet_double() [L86] EXPR WrapperStruct0.var_1_11 [L86] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F [L86] EXPR WrapperStruct0.var_1_11 [L86] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] CALL assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] RET assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L103] RET updateVariables() [L104] CALL step() [L52] unsigned char stepLocal_0 = last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10; VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10, stepLocal_0=0] [L53] COND FALSE !(((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || stepLocal_0) [L56] WrapperStruct0.var_1_12 = last_1_WrapperStruct0_var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L58] EXPR WrapperStruct0.var_1_12 [L58] WrapperStruct0.var_1_14 = WrapperStruct0.var_1_12 [L59] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L59] EXPR 10 << WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L59] EXPR WrapperStruct0.var_1_3 [L59] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L59] COND TRUE (10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14) [L60] EXPR WrapperStruct0.var_1_12 [L60] EXPR WrapperStruct0.var_1_14 [L60] WrapperStruct0.var_1_8 = (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14) [L62] WrapperStruct0.var_1_9 = 64 [L63] EXPR WrapperStruct0.var_1_11 [L63] WrapperStruct0.var_1_10 = WrapperStruct0.var_1_11 [L64] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L64] COND TRUE WrapperStruct0.var_1_12 <= 16 [L65] EXPR WrapperStruct0.var_1_3 [L65] WrapperStruct0.var_1_1 = WrapperStruct0.var_1_3 [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) [L95] EXPR WrapperStruct0.var_1_1 [L95] EXPR WrapperStruct0.var_1_3 [L95] EXPR (WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1) [L95] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR 10 << WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR WrapperStruct0.var_1_3 [L95] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1 [L95] EXPR WrapperStruct0.var_1_8 [L95] EXPR WrapperStruct0.var_1_12 [L95] EXPR WrapperStruct0.var_1_14 [L95] EXPR ((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64)) [L95] EXPR WrapperStruct0.var_1_9 [L95] EXPR (((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11)) [L95] EXPR WrapperStruct0.var_1_10 [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR ((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && (WrapperStruct0.var_1_14 == ((signed long int) WrapperStruct0.var_1_12)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && (WrapperStruct0.var_1_14 == ((signed long int) WrapperStruct0.var_1_12)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95-L96] return ((((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && (WrapperStruct0.var_1_14 == ((signed long int) WrapperStruct0.var_1_12)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L19] reach_error() VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 928 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 927 mSDsluCounter, 1895 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1325 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 705 IncrementalHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 570 mSDtfsCounter, 705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, InterpolantAutomatonStates: 35, 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, 8 MinimizatonAttempts, 169 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 320/320 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:53:44,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-9.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 68b0cda5422c6df9a05dd00f43cb56ae62ac5ef3a6cb82099875e56a3f490744 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:53:46,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:53:46,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:53:46,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:53:46,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:53:46,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:53:46,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:53:46,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:53:46,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:53:46,648 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:53:46,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:53:46,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:53:46,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:53:46,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:53:46,650 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:53:46,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:53:46,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:53:46,650 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:53:46,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:53:46,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:53:46,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:53:46,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:53:46,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:53:46,655 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:53:46,655 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:53:46,655 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:53:46,655 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:53:46,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:53:46,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:53:46,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:53:46,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:53:46,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:53:46,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:53:46,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:53:46,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:53:46,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:53:46,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:53:46,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:53:46,658 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:53:46,658 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:53:46,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:53:46,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:53:46,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:53:46,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:53:46,661 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:53:46,661 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 -> 68b0cda5422c6df9a05dd00f43cb56ae62ac5ef3a6cb82099875e56a3f490744 [2024-10-24 11:53:46,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:53:46,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:53:46,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:53:46,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:53:46,933 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:53:46,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i [2024-10-24 11:53:48,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:53:48,405 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:53:48,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i [2024-10-24 11:53:48,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600d4981e/900ce3ca9c784c95b817df495ad40421/FLAGfae1546b3 [2024-10-24 11:53:48,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600d4981e/900ce3ca9c784c95b817df495ad40421 [2024-10-24 11:53:48,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:53:48,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:53:48,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:53:48,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:53:48,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:53:48,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275f7d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48, skipping insertion in model container [2024-10-24 11:53:48,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:53:48,611 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-9.i[915,928] [2024-10-24 11:53:48,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:53:48,663 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:53:48,673 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-9.i[915,928] [2024-10-24 11:53:48,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:53:48,734 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:53:48,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48 WrapperNode [2024-10-24 11:53:48,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:53:48,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:53:48,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:53:48,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:53:48,741 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:53:48" (1/1) ... [2024-10-24 11:53:48,760 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:53:48" (1/1) ... [2024-10-24 11:53:48,793 INFO L138 Inliner]: procedures = 36, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 328 [2024-10-24 11:53:48,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:53:48,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:53:48,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:53:48,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:53:48,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,831 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-10-24 11:53:48,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:53:48,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:53:48,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:53:48,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:53:48,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48" (1/1) ... [2024-10-24 11:53:48,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:53:48,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:53:48,908 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:53:48,910 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:53:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:53:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:53:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:53:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:53:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:53:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:53:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:53:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:53:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:53:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:53:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:53:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:53:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:53:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:53:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:53:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:53:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:53:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:53:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:53:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:53:48,954 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:53:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:53:48,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:53:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:53:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:53:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:53:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:53:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:53:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:53:49,057 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:53:49,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:53:49,483 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-10-24 11:53:49,484 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:53:49,551 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:53:49,551 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:53:49,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:49 BoogieIcfgContainer [2024-10-24 11:53:49,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:53:49,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:53:49,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:53:49,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:53:49,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:53:48" (1/3) ... [2024-10-24 11:53:49,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e054070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:49, skipping insertion in model container [2024-10-24 11:53:49,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:48" (2/3) ... [2024-10-24 11:53:49,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e054070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:49, skipping insertion in model container [2024-10-24 11:53:49,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:49" (3/3) ... [2024-10-24 11:53:49,559 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-9.i [2024-10-24 11:53:49,571 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:53:49,571 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:53:49,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:53:49,617 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;@d0ea057, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:53:49,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:53:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 11:53:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 11:53:49,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:49,627 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:49,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:49,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:49,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1101514449, now seen corresponding path program 1 times [2024-10-24 11:53:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210308519] [2024-10-24 11:53:49,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:49,640 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:53:49,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:49,643 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:53:49,643 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:53:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:49,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:53:49,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 11:53:49,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:49,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:49,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210308519] [2024-10-24 11:53:49,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210308519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:49,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:49,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:53:49,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43787407] [2024-10-24 11:53:49,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:49,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:53:49,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:49,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:53:49,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:53:49,882 INFO L87 Difference]: Start difference. First operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:53:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:49,920 INFO L93 Difference]: Finished difference Result 123 states and 187 transitions. [2024-10-24 11:53:49,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:53:49,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-10-24 11:53:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:49,933 INFO L225 Difference]: With dead ends: 123 [2024-10-24 11:53:49,933 INFO L226 Difference]: Without dead ends: 61 [2024-10-24 11:53:49,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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:53:49,940 INFO L432 NwaCegarLoop]: 83 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, 83 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:53:49,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:53:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-24 11:53:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-24 11:53:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 11:53:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-10-24 11:53:49,977 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 55 [2024-10-24 11:53:49,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:49,977 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-10-24 11:53:49,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:53:49,978 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-10-24 11:53:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 11:53:49,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:49,983 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:49,990 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:53:50,183 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:53:50,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:50,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash 6585845, now seen corresponding path program 1 times [2024-10-24 11:53:50,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:50,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817818468] [2024-10-24 11:53:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:50,186 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:53:50,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:50,188 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:53:50,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:53:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:50,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:53:50,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:53:50,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:50,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:50,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817818468] [2024-10-24 11:53:50,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817818468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:50,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:50,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:53:50,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765826447] [2024-10-24 11:53:50,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:50,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:53:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:50,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:53:50,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:53:50,389 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:50,440 INFO L93 Difference]: Finished difference Result 124 states and 177 transitions. [2024-10-24 11:53:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:53:50,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2024-10-24 11:53:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:50,442 INFO L225 Difference]: With dead ends: 124 [2024-10-24 11:53:50,442 INFO L226 Difference]: Without dead ends: 64 [2024-10-24 11:53:50,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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:53:50,444 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 233 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:53:50,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 233 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:53:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-24 11:53:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-10-24 11:53:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 11:53:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2024-10-24 11:53:50,455 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 55 [2024-10-24 11:53:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:50,456 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2024-10-24 11:53:50,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2024-10-24 11:53:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 11:53:50,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:50,459 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:50,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:53:50,659 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:53:50,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:50,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash -386441165, now seen corresponding path program 1 times [2024-10-24 11:53:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:50,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680310728] [2024-10-24 11:53:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:50,661 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:53:50,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:50,662 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:53:50,663 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:53:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:50,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:53:50,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:53:50,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:50,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:50,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680310728] [2024-10-24 11:53:50,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680310728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:50,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:53:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051041323] [2024-10-24 11:53:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:50,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:53:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:53:50,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:53:50,841 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:50,902 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2024-10-24 11:53:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:53:50,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2024-10-24 11:53:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:50,905 INFO L225 Difference]: With dead ends: 128 [2024-10-24 11:53:50,906 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 11:53:50,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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:53:50,908 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:50,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 303 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:53:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 11:53:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-24 11:53:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 11:53:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-10-24 11:53:50,922 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 55 [2024-10-24 11:53:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:50,922 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-10-24 11:53:50,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-10-24 11:53:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 11:53:50,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:50,925 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:50,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:53:51,125 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:53:51,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:51,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:51,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1195787791, now seen corresponding path program 1 times [2024-10-24 11:53:51,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:51,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307390318] [2024-10-24 11:53:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:51,127 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:53:51,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:51,130 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:53:51,131 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:53:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:53:51,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:53:51,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:51,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:51,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307390318] [2024-10-24 11:53:51,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307390318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:51,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:51,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:53:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655937544] [2024-10-24 11:53:51,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:51,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:53:51,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:51,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:53:51,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:53:51,303 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:51,382 INFO L93 Difference]: Finished difference Result 134 states and 188 transitions. [2024-10-24 11:53:51,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:53:51,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2024-10-24 11:53:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:51,384 INFO L225 Difference]: With dead ends: 134 [2024-10-24 11:53:51,384 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 11:53:51,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 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:53:51,385 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:51,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:53:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 11:53:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-24 11:53:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 11:53:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2024-10-24 11:53:51,389 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 55 [2024-10-24 11:53:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:51,390 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2024-10-24 11:53:51,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:53:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2024-10-24 11:53:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 11:53:51,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:51,391 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:51,397 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:53:51,591 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:53:51,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:51,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1195728209, now seen corresponding path program 1 times [2024-10-24 11:53:51,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:51,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767644027] [2024-10-24 11:53:51,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:51,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:51,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:51,596 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:53:51,597 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:53:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 11:53:51,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:51,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:53:51,803 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:53:51,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2024-10-24 11:53:54,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:54,170 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 50 treesize of output 40 [2024-10-24 11:53:54,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:54,188 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 50 treesize of output 40 [2024-10-24 11:53:54,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:54,209 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 62 treesize of output 73 [2024-10-24 11:53:54,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:54,272 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 89 treesize of output 96 [2024-10-24 11:53:54,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:54,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 97 treesize of output 120 [2024-10-24 11:53:54,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:54,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 137 treesize of output 59 [2024-10-24 11:53:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 11:53:54,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:54,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:54,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767644027] [2024-10-24 11:53:54,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767644027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:54,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:54,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:53:54,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809105823] [2024-10-24 11:53:54,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:54,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:53:54,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:54,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:53:54,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=46, Unknown=1, NotChecked=0, Total=72 [2024-10-24 11:53:54,540 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 11:53:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:55,944 INFO L93 Difference]: Finished difference Result 205 states and 283 transitions. [2024-10-24 11:53:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:53:55,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2024-10-24 11:53:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:55,946 INFO L225 Difference]: With dead ends: 205 [2024-10-24 11:53:55,946 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 11:53:55,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=41, Invalid=68, Unknown=1, NotChecked=0, Total=110 [2024-10-24 11:53:55,947 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 231 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:55,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 318 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 11:53:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 11:53:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 79. [2024-10-24 11:53:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 11:53:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2024-10-24 11:53:55,956 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 55 [2024-10-24 11:53:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:55,957 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2024-10-24 11:53:55,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 11:53:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2024-10-24 11:53:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 11:53:55,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:55,958 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:55,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 11:53:56,158 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:53:56,159 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:56,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:56,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1105094381, now seen corresponding path program 1 times [2024-10-24 11:53:56,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:56,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748036325] [2024-10-24 11:53:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:56,160 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:53:56,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:56,161 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:53:56,162 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:53:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:56,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 11:53:56,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:56,311 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 29 treesize of output 17 [2024-10-24 11:53:56,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:53:56,332 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:53:56,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2024-10-24 11:53:58,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:58,599 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 47 treesize of output 52 [2024-10-24 11:53:58,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2024-10-24 11:53:58,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:58,834 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 113 treesize of output 123 [2024-10-24 11:53:58,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:58,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 136 treesize of output 141 [2024-10-24 11:53:59,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:59,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 175 treesize of output 85 [2024-10-24 11:53:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 11:53:59,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:59,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:59,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748036325] [2024-10-24 11:53:59,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748036325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:59,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:59,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:53:59,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061289989] [2024-10-24 11:53:59,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:59,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:53:59,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:59,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:53:59,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=117, Unknown=1, NotChecked=0, Total=156 [2024-10-24 11:53:59,175 INFO L87 Difference]: Start difference. First operand 79 states and 110 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 11:54:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:01,261 INFO L93 Difference]: Finished difference Result 329 states and 456 transitions. [2024-10-24 11:54:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:54:01,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2024-10-24 11:54:01,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:01,263 INFO L225 Difference]: With dead ends: 329 [2024-10-24 11:54:01,263 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 11:54:01,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=117, Invalid=262, Unknown=1, NotChecked=0, Total=380 [2024-10-24 11:54:01,264 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 383 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:01,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 433 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 11:54:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 11:54:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 145. [2024-10-24 11:54:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.378787878787879) internal successors, (182), 132 states have internal predecessors, (182), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:54:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 202 transitions. [2024-10-24 11:54:01,292 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 202 transitions. Word has length 55 [2024-10-24 11:54:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:01,292 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 202 transitions. [2024-10-24 11:54:01,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 11:54:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 202 transitions. [2024-10-24 11:54:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:54:01,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:01,293 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:01,303 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:54:01,493 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:54:01,494 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:01,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:01,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1497772152, now seen corresponding path program 1 times [2024-10-24 11:54:01,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:01,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252586062] [2024-10-24 11:54:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:01,495 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:54:01,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:01,497 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:54:01,498 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:54:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:01,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 11:54:01,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:01,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2024-10-24 11:54:01,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:01,991 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 142 treesize of output 63 [2024-10-24 11:54:02,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:02,043 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 142 treesize of output 63 [2024-10-24 11:54:02,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:02,099 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 154 treesize of output 96 [2024-10-24 11:54:02,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:02,169 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 203 treesize of output 156 [2024-10-24 11:54:02,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:02,281 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 222 treesize of output 165 [2024-10-24 11:54:02,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:02,669 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 412 treesize of output 154 [2024-10-24 11:54:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 11:54:02,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:54:02,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:02,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252586062] [2024-10-24 11:54:02,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252586062] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:54:02,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2063095848] [2024-10-24 11:54:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:02,913 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:54:02,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:54:02,916 INFO L229 MonitoredProcess]: Starting monitored process 9 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:54:02,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-24 11:54:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:03,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:54:03,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:03,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-24 11:54:04,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:04,153 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 120 treesize of output 63 [2024-10-24 11:54:04,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:04,227 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 120 treesize of output 63 [2024-10-24 11:54:04,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:04,295 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 130 treesize of output 90 [2024-10-24 11:54:04,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:04,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 176 treesize of output 136 [2024-10-24 11:54:04,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:04,548 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 69 treesize of output 75 [2024-10-24 11:54:04,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:04,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 211 treesize of output 87 [2024-10-24 11:54:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 11:54:04,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:54:04,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2063095848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:54:04,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:54:04,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-10-24 11:54:04,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129166743] [2024-10-24 11:54:04,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:54:04,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 11:54:04,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 11:54:04,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:54:04,998 INFO L87 Difference]: Start difference. First operand 145 states and 202 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 17 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 11:54:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:10,506 INFO L93 Difference]: Finished difference Result 531 states and 732 transitions. [2024-10-24 11:54:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:54:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 17 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 57 [2024-10-24 11:54:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:10,508 INFO L225 Difference]: With dead ends: 531 [2024-10-24 11:54:10,509 INFO L226 Difference]: Without dead ends: 387 [2024-10-24 11:54:10,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 137 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:54:10,510 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 594 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:10,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 375 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-24 11:54:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-24 11:54:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 379. [2024-10-24 11:54:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 344 states have (on average 1.3575581395348837) internal successors, (467), 348 states have internal predecessors, (467), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:54:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 523 transitions. [2024-10-24 11:54:10,552 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 523 transitions. Word has length 57 [2024-10-24 11:54:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:10,552 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 523 transitions. [2024-10-24 11:54:10,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 17 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 11:54:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 523 transitions. [2024-10-24 11:54:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:54:10,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:10,555 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:10,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-24 11:54:10,762 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:54:10,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:54:10,956 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:10,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:10,956 INFO L85 PathProgramCache]: Analyzing trace with hash 688425526, now seen corresponding path program 1 times [2024-10-24 11:54:10,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:10,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499929102] [2024-10-24 11:54:10,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:10,957 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:54:10,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:10,958 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:54:10,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 11:54:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:11,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:54:11,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:11,118 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 36 treesize of output 10 [2024-10-24 11:54:11,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-24 11:54:11,140 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 40 treesize of output 22 [2024-10-24 11:54:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:54:11,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:11,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499929102] [2024-10-24 11:54:11,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499929102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:11,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:11,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:54:11,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939247078] [2024-10-24 11:54:11,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:11,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:54:11,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:11,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:54:11,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:54:11,150 INFO L87 Difference]: Start difference. First operand 379 states and 523 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:11,421 INFO L93 Difference]: Finished difference Result 806 states and 1110 transitions. [2024-10-24 11:54:11,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:54:11,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-24 11:54:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:11,425 INFO L225 Difference]: With dead ends: 806 [2024-10-24 11:54:11,425 INFO L226 Difference]: Without dead ends: 428 [2024-10-24 11:54:11,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:54:11,427 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 68 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:11,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 241 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:54:11,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-24 11:54:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 405. [2024-10-24 11:54:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 362 states have (on average 1.3342541436464088) internal successors, (483), 368 states have internal predecessors, (483), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 28 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:54:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 551 transitions. [2024-10-24 11:54:11,468 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 551 transitions. Word has length 57 [2024-10-24 11:54:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:11,469 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 551 transitions. [2024-10-24 11:54:11,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 551 transitions. [2024-10-24 11:54:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:54:11,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:11,470 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:11,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 11:54:11,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:54:11,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:11,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:11,672 INFO L85 PathProgramCache]: Analyzing trace with hash 295398516, now seen corresponding path program 1 times [2024-10-24 11:54:11,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:11,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351877475] [2024-10-24 11:54:11,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:11,672 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:54:11,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:11,674 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:54:11,675 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:54:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:11,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 11:54:11,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:11,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:54:11,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-24 11:54:11,877 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 32 treesize of output 25 [2024-10-24 11:54:11,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:11,896 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 54 treesize of output 44 [2024-10-24 11:54:11,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:11,929 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 83 treesize of output 60 [2024-10-24 11:54:11,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:11,963 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 72 treesize of output 63 [2024-10-24 11:54:12,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:12,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 125 treesize of output 59 [2024-10-24 11:54:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:54:12,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:12,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:12,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351877475] [2024-10-24 11:54:12,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351877475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:12,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:12,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:54:12,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954237992] [2024-10-24 11:54:12,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:12,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:54:12,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:12,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:54:12,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:54:12,039 INFO L87 Difference]: Start difference. First operand 405 states and 551 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:13,179 INFO L93 Difference]: Finished difference Result 1103 states and 1502 transitions. [2024-10-24 11:54:13,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 11:54:13,179 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-24 11:54:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:13,182 INFO L225 Difference]: With dead ends: 1103 [2024-10-24 11:54:13,182 INFO L226 Difference]: Without dead ends: 725 [2024-10-24 11:54:13,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:54:13,184 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 409 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:13,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 489 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:54:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-24 11:54:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 548. [2024-10-24 11:54:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 493 states have (on average 1.3204868154158216) internal successors, (651), 500 states have internal predecessors, (651), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 37 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:54:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 739 transitions. [2024-10-24 11:54:13,237 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 739 transitions. Word has length 57 [2024-10-24 11:54:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:13,237 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 739 transitions. [2024-10-24 11:54:13,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 739 transitions. [2024-10-24 11:54:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:54:13,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:13,238 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:13,246 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:54:13,439 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:54:13,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:13,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash 680123702, now seen corresponding path program 1 times [2024-10-24 11:54:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:13,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915897312] [2024-10-24 11:54:13,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:13,440 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:54:13,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:13,441 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:54:13,442 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:54:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:13,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 11:54:13,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:13,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:13,604 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 50 treesize of output 31 [2024-10-24 11:54:13,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:13,680 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 45 treesize of output 41 [2024-10-24 11:54:13,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:13,800 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 56 treesize of output 50 [2024-10-24 11:54:15,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:15,494 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 57 treesize of output 56 [2024-10-24 11:54:17,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:17,141 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 64 treesize of output 66 [2024-10-24 11:54:17,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 99 [2024-10-24 11:54:17,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:17,286 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 116 treesize of output 113 [2024-10-24 11:54:17,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:17,455 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 158 treesize of output 68 [2024-10-24 11:54:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 11:54:17,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:17,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915897312] [2024-10-24 11:54:17,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915897312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:17,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:17,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:54:17,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320437223] [2024-10-24 11:54:17,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:17,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:54:17,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:17,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:54:17,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=114, Unknown=2, NotChecked=0, Total=156 [2024-10-24 11:54:17,498 INFO L87 Difference]: Start difference. First operand 548 states and 739 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 11:54:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:18,873 INFO L93 Difference]: Finished difference Result 1081 states and 1456 transitions. [2024-10-24 11:54:18,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:54:18,878 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2024-10-24 11:54:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:18,880 INFO L225 Difference]: With dead ends: 1081 [2024-10-24 11:54:18,880 INFO L226 Difference]: Without dead ends: 560 [2024-10-24 11:54:18,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=106, Invalid=234, Unknown=2, NotChecked=0, Total=342 [2024-10-24 11:54:18,882 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 180 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:18,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 532 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 11:54:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-24 11:54:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 536. [2024-10-24 11:54:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 481 states have (on average 1.3076923076923077) internal successors, (629), 488 states have internal predecessors, (629), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 37 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:54:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 717 transitions. [2024-10-24 11:54:18,938 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 717 transitions. Word has length 57 [2024-10-24 11:54:18,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:18,938 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 717 transitions. [2024-10-24 11:54:18,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 11:54:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 717 transitions. [2024-10-24 11:54:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:54:18,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:18,940 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:18,949 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:54:19,140 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:54:19,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:19,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:19,141 INFO L85 PathProgramCache]: Analyzing trace with hash -522249934, now seen corresponding path program 1 times [2024-10-24 11:54:19,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:19,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750869277] [2024-10-24 11:54:19,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:19,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:54:19,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:19,145 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:54:19,145 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:54:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:19,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:54:19,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:19,308 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 29 treesize of output 17 [2024-10-24 11:54:19,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:54:19,325 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:54:19,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-10-24 11:54:21,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:21,202 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 37 treesize of output 39 [2024-10-24 11:54:21,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2024-10-24 11:54:21,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:21,369 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 121 treesize of output 77 [2024-10-24 11:54:21,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:21,405 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 95 treesize of output 77 [2024-10-24 11:54:21,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:21,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 109 treesize of output 43 [2024-10-24 11:54:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 11:54:21,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:21,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:21,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750869277] [2024-10-24 11:54:21,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750869277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:21,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:21,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:54:21,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343122804] [2024-10-24 11:54:21,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:21,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:54:21,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:21,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:54:21,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2024-10-24 11:54:21,562 INFO L87 Difference]: Start difference. First operand 536 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 11:54:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:23,501 INFO L93 Difference]: Finished difference Result 1248 states and 1670 transitions. [2024-10-24 11:54:23,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:54:23,502 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2024-10-24 11:54:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:23,506 INFO L225 Difference]: With dead ends: 1248 [2024-10-24 11:54:23,506 INFO L226 Difference]: Without dead ends: 739 [2024-10-24 11:54:23,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=61, Invalid=120, Unknown=1, NotChecked=0, Total=182 [2024-10-24 11:54:23,507 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 392 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:23,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 296 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 11:54:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-10-24 11:54:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 553. [2024-10-24 11:54:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 498 states have (on average 1.3092369477911647) internal successors, (652), 505 states have internal predecessors, (652), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 37 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:54:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 740 transitions. [2024-10-24 11:54:23,558 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 740 transitions. Word has length 57 [2024-10-24 11:54:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:23,559 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 740 transitions. [2024-10-24 11:54:23,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 11:54:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 740 transitions. [2024-10-24 11:54:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:54:23,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:23,561 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:23,568 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:54:23,761 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:54:23,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:23,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:23,762 INFO L85 PathProgramCache]: Analyzing trace with hash 93317688, now seen corresponding path program 1 times [2024-10-24 11:54:23,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:23,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762429840] [2024-10-24 11:54:23,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:23,762 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:54:23,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:23,766 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:54:23,770 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:54:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:23,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 11:54:23,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:24,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2024-10-24 11:54:24,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:24,244 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 142 treesize of output 63 [2024-10-24 11:54:24,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:24,258 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 142 treesize of output 63 [2024-10-24 11:54:24,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:24,280 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 211 treesize of output 104 [2024-10-24 11:54:24,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:24,356 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 170 treesize of output 119 [2024-10-24 11:54:24,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:24,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 360 treesize of output 144 [2024-10-24 11:54:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 11:54:24,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:54:24,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:24,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762429840] [2024-10-24 11:54:24,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762429840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:54:24,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1988745466] [2024-10-24 11:54:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:24,821 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:54:24,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:54:24,822 INFO L229 MonitoredProcess]: Starting monitored process 15 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:54:24,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-10-24 11:54:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:25,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:54:25,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:25,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-24 11:54:26,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:26,320 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 120 treesize of output 63 [2024-10-24 11:54:26,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:26,388 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 120 treesize of output 63 [2024-10-24 11:54:26,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:26,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 108 [2024-10-24 11:54:26,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:26,527 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 162 treesize of output 126 [2024-10-24 11:54:26,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:26,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 304 treesize of output 152 [2024-10-24 11:54:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 11:54:26,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:54:27,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1988745466] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:54:27,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:54:27,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-24 11:54:27,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14165711] [2024-10-24 11:54:27,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:54:27,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 11:54:27,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:27,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 11:54:27,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:54:27,018 INFO L87 Difference]: Start difference. First operand 553 states and 740 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 11:54:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:29,230 INFO L93 Difference]: Finished difference Result 1096 states and 1458 transitions. [2024-10-24 11:54:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:54:29,232 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 57 [2024-10-24 11:54:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:29,234 INFO L225 Difference]: With dead ends: 1096 [2024-10-24 11:54:29,234 INFO L226 Difference]: Without dead ends: 570 [2024-10-24 11:54:29,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-10-24 11:54:29,235 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 310 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:29,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 278 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 11:54:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-24 11:54:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 455. [2024-10-24 11:54:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 415 states have (on average 1.3204819277108433) internal successors, (548), 418 states have internal predecessors, (548), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:54:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 608 transitions. [2024-10-24 11:54:29,279 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 608 transitions. Word has length 57 [2024-10-24 11:54:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:29,279 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 608 transitions. [2024-10-24 11:54:29,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 11:54:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 608 transitions. [2024-10-24 11:54:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:54:29,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:29,280 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:29,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-10-24 11:54:29,488 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:54:29,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:54:29,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:29,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash 778787762, now seen corresponding path program 1 times [2024-10-24 11:54:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:29,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576423123] [2024-10-24 11:54:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:29,683 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:54:29,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:29,685 INFO L229 MonitoredProcess]: Starting monitored process 16 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:54:29,689 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 (16)] Waiting until timeout for monitored process [2024-10-24 11:54:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:29,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:54:29,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:29,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:29,819 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 37 treesize of output 17 [2024-10-24 11:54:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:54:29,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:29,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:29,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576423123] [2024-10-24 11:54:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576423123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:29,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:29,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:54:29,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513851954] [2024-10-24 11:54:29,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:29,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:54:29,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:29,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:54:29,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:54:29,908 INFO L87 Difference]: Start difference. First operand 455 states and 608 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:30,243 INFO L93 Difference]: Finished difference Result 1105 states and 1466 transitions. [2024-10-24 11:54:30,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:54:30,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-24 11:54:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:30,246 INFO L225 Difference]: With dead ends: 1105 [2024-10-24 11:54:30,246 INFO L226 Difference]: Without dead ends: 651 [2024-10-24 11:54:30,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:54:30,247 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 76 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:30,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 224 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:54:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-10-24 11:54:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 589. [2024-10-24 11:54:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 541 states have (on average 1.3160813308687616) internal successors, (712), 544 states have internal predecessors, (712), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:54:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 784 transitions. [2024-10-24 11:54:30,301 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 784 transitions. Word has length 57 [2024-10-24 11:54:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:30,301 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 784 transitions. [2024-10-24 11:54:30,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 784 transitions. [2024-10-24 11:54:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 11:54:30,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:30,302 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:30,311 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 (16)] Ended with exit code 0 [2024-10-24 11:54:30,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:54:30,502 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:30,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:30,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2095595270, now seen corresponding path program 1 times [2024-10-24 11:54:30,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:30,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387022861] [2024-10-24 11:54:30,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:30,503 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:54:30,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:30,505 INFO L229 MonitoredProcess]: Starting monitored process 17 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:54:30,506 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 (17)] Waiting until timeout for monitored process [2024-10-24 11:54:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:30,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:54:30,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 11:54:30,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:30,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387022861] [2024-10-24 11:54:30,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387022861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:30,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:30,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:54:30,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577604647] [2024-10-24 11:54:30,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:30,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:54:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:30,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:54:30,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:30,645 INFO L87 Difference]: Start difference. First operand 589 states and 784 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:54:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:30,728 INFO L93 Difference]: Finished difference Result 1102 states and 1468 transitions. [2024-10-24 11:54:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:54:30,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-10-24 11:54:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:30,730 INFO L225 Difference]: With dead ends: 1102 [2024-10-24 11:54:30,730 INFO L226 Difference]: Without dead ends: 589 [2024-10-24 11:54:30,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 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:54:30,732 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:30,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:54:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-10-24 11:54:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2024-10-24 11:54:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 541 states have (on average 1.3086876155268021) internal successors, (708), 544 states have internal predecessors, (708), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:54:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 780 transitions. [2024-10-24 11:54:30,778 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 780 transitions. Word has length 57 [2024-10-24 11:54:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:30,778 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 780 transitions. [2024-10-24 11:54:30,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:54:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 780 transitions. [2024-10-24 11:54:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 11:54:30,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:30,779 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:30,786 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 (17)] Forceful destruction successful, exit code 0 [2024-10-24 11:54:30,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:54:30,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:30,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1396214344, now seen corresponding path program 1 times [2024-10-24 11:54:30,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:30,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688337930] [2024-10-24 11:54:30,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:30,984 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:54:30,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:30,986 INFO L229 MonitoredProcess]: Starting monitored process 18 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:54:30,987 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 (18)] Waiting until timeout for monitored process [2024-10-24 11:54:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:31,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:54:31,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:31,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:54:31,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-24 11:54:31,268 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 32 treesize of output 25 [2024-10-24 11:54:31,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:31,292 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 54 treesize of output 44 [2024-10-24 11:54:31,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:31,328 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 65 treesize of output 78 [2024-10-24 11:54:31,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:31,402 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 84 treesize of output 87 [2024-10-24 11:54:31,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:31,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 110 treesize of output 50 [2024-10-24 11:54:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:54:31,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:31,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:31,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688337930] [2024-10-24 11:54:31,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688337930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:31,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:31,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:54:31,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478737860] [2024-10-24 11:54:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:31,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:54:31,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:31,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:54:31,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:54:31,855 INFO L87 Difference]: Start difference. First operand 589 states and 780 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:33,399 INFO L93 Difference]: Finished difference Result 729 states and 967 transitions. [2024-10-24 11:54:33,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:54:33,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-24 11:54:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:33,402 INFO L225 Difference]: With dead ends: 729 [2024-10-24 11:54:33,402 INFO L226 Difference]: Without dead ends: 727 [2024-10-24 11:54:33,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:54:33,403 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 371 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:33,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 443 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 11:54:33,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-24 11:54:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 597. [2024-10-24 11:54:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 549 states have (on average 1.3041894353369763) internal successors, (716), 552 states have internal predecessors, (716), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:54:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 788 transitions. [2024-10-24 11:54:33,458 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 788 transitions. Word has length 59 [2024-10-24 11:54:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:33,459 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 788 transitions. [2024-10-24 11:54:33,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 788 transitions. [2024-10-24 11:54:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 11:54:33,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:33,460 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:33,467 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 (18)] Ended with exit code 0 [2024-10-24 11:54:33,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:54:33,664 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:33,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:33,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1396273926, now seen corresponding path program 1 times [2024-10-24 11:54:33,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:33,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499201024] [2024-10-24 11:54:33,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:33,666 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:54:33,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:33,668 INFO L229 MonitoredProcess]: Starting monitored process 19 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:54:33,670 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 (19)] Waiting until timeout for monitored process [2024-10-24 11:54:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:33,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:54:33,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:33,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:54:33,884 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:54:33,899 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 32 treesize of output 25 [2024-10-24 11:54:33,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:33,923 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 59 treesize of output 43 [2024-10-24 11:54:33,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:33,952 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 86 treesize of output 48 [2024-10-24 11:54:33,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:33,966 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 60 treesize of output 48 [2024-10-24 11:54:34,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:34,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 89 treesize of output 53 [2024-10-24 11:54:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:54:34,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:34,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499201024] [2024-10-24 11:54:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499201024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:34,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:34,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:54:34,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202703183] [2024-10-24 11:54:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:34,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:54:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:54:34,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:54:34,221 INFO L87 Difference]: Start difference. First operand 597 states and 788 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:35,934 INFO L93 Difference]: Finished difference Result 1199 states and 1588 transitions. [2024-10-24 11:54:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:54:35,934 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-24 11:54:35,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:35,937 INFO L225 Difference]: With dead ends: 1199 [2024-10-24 11:54:35,937 INFO L226 Difference]: Without dead ends: 737 [2024-10-24 11:54:35,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:54:35,939 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 380 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:35,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 465 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 11:54:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-24 11:54:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 609. [2024-10-24 11:54:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 561 states have (on average 1.2976827094474153) internal successors, (728), 564 states have internal predecessors, (728), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:54:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 800 transitions. [2024-10-24 11:54:35,999 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 800 transitions. Word has length 59 [2024-10-24 11:54:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:36,000 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 800 transitions. [2024-10-24 11:54:36,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 800 transitions. [2024-10-24 11:54:36,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 11:54:36,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:36,001 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:36,010 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 (19)] Forceful destruction successful, exit code 0 [2024-10-24 11:54:36,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:54:36,201 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:36,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:36,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2086572569, now seen corresponding path program 1 times [2024-10-24 11:54:36,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:36,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134812374] [2024-10-24 11:54:36,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:36,202 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:54:36,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:36,203 INFO L229 MonitoredProcess]: Starting monitored process 20 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:54:36,205 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 (20)] Waiting until timeout for monitored process [2024-10-24 11:54:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:36,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:54:36,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:36,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:36,357 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 103 treesize of output 31 [2024-10-24 11:54:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:54:36,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:36,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:36,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134812374] [2024-10-24 11:54:36,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134812374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:36,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:36,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:54:36,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474677364] [2024-10-24 11:54:36,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:36,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:54:36,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:36,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:54:36,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:54:36,369 INFO L87 Difference]: Start difference. First operand 609 states and 800 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:36,450 INFO L93 Difference]: Finished difference Result 1147 states and 1504 transitions. [2024-10-24 11:54:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:54:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-24 11:54:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:36,452 INFO L225 Difference]: With dead ends: 1147 [2024-10-24 11:54:36,452 INFO L226 Difference]: Without dead ends: 609 [2024-10-24 11:54:36,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:54:36,453 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:36,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:54:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-10-24 11:54:36,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-10-24 11:54:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 561 states have (on average 1.2762923351158646) internal successors, (716), 564 states have internal predecessors, (716), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:54:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 788 transitions. [2024-10-24 11:54:36,508 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 788 transitions. Word has length 59 [2024-10-24 11:54:36,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:36,509 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 788 transitions. [2024-10-24 11:54:36,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:36,509 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 788 transitions. [2024-10-24 11:54:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 11:54:36,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:36,509 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:36,516 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 (20)] Ended with exit code 0 [2024-10-24 11:54:36,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:54:36,710 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:36,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:36,711 INFO L85 PathProgramCache]: Analyzing trace with hash 620046825, now seen corresponding path program 1 times [2024-10-24 11:54:36,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:36,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236835281] [2024-10-24 11:54:36,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:36,711 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:54:36,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:36,712 INFO L229 MonitoredProcess]: Starting monitored process 21 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:54:36,713 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 (21)] Waiting until timeout for monitored process [2024-10-24 11:54:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:36,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:54:36,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:36,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:54:36,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-24 11:54:36,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-24 11:54:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:54:36,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:36,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:36,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236835281] [2024-10-24 11:54:36,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236835281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:36,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:36,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:54:36,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064920325] [2024-10-24 11:54:36,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:36,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:54:36,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:54:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:54:36,998 INFO L87 Difference]: Start difference. First operand 609 states and 788 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:37,454 INFO L93 Difference]: Finished difference Result 1357 states and 1746 transitions. [2024-10-24 11:54:37,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:54:37,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-24 11:54:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:37,457 INFO L225 Difference]: With dead ends: 1357 [2024-10-24 11:54:37,457 INFO L226 Difference]: Without dead ends: 815 [2024-10-24 11:54:37,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:54:37,458 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 58 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:37,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 212 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:54:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-10-24 11:54:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 583. [2024-10-24 11:54:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 535 states have (on average 1.2598130841121495) internal successors, (674), 538 states have internal predecessors, (674), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:54:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 746 transitions. [2024-10-24 11:54:37,510 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 746 transitions. Word has length 59 [2024-10-24 11:54:37,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:37,511 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 746 transitions. [2024-10-24 11:54:37,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 11:54:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 746 transitions. [2024-10-24 11:54:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 11:54:37,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:37,512 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:37,519 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 (21)] Ended with exit code 0 [2024-10-24 11:54:37,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:54:37,716 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:37,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -844961412, now seen corresponding path program 1 times [2024-10-24 11:54:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819135317] [2024-10-24 11:54:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:37,717 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:54:37,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:37,719 INFO L229 MonitoredProcess]: Starting monitored process 22 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:54:37,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 (22)] Waiting until timeout for monitored process [2024-10-24 11:54:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:37,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:54:37,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 11:54:37,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:37,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819135317] [2024-10-24 11:54:37,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819135317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:37,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:37,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:54:37,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171395155] [2024-10-24 11:54:37,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:37,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:54:37,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:54:37,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:54:37,875 INFO L87 Difference]: Start difference. First operand 583 states and 746 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:54:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:37,980 INFO L93 Difference]: Finished difference Result 1113 states and 1426 transitions. [2024-10-24 11:54:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:54:37,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-24 11:54:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:37,983 INFO L225 Difference]: With dead ends: 1113 [2024-10-24 11:54:37,983 INFO L226 Difference]: Without dead ends: 597 [2024-10-24 11:54:37,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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:54:37,984 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:37,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 356 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:54:37,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-10-24 11:54:38,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 583. [2024-10-24 11:54:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 535 states have (on average 1.2523364485981308) internal successors, (670), 538 states have internal predecessors, (670), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:54:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 742 transitions. [2024-10-24 11:54:38,042 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 742 transitions. Word has length 59 [2024-10-24 11:54:38,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:38,042 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 742 transitions. [2024-10-24 11:54:38,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 11:54:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 742 transitions. [2024-10-24 11:54:38,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 11:54:38,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:38,043 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:38,051 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 (22)] Ended with exit code 0 [2024-10-24 11:54:38,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:54:38,244 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:38,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash -867593666, now seen corresponding path program 1 times [2024-10-24 11:54:38,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:38,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973751501] [2024-10-24 11:54:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:38,245 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:54:38,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:38,246 INFO L229 MonitoredProcess]: Starting monitored process 23 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:54:38,247 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 (23)] Waiting until timeout for monitored process [2024-10-24 11:54:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:38,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:54:38,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:38,480 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 20 treesize of output 21 [2024-10-24 11:54:40,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:40,890 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 150 treesize of output 65 [2024-10-24 11:54:40,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:40,950 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 150 treesize of output 65 [2024-10-24 11:54:40,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:40,972 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 162 treesize of output 98 [2024-10-24 11:54:41,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:41,072 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 216 treesize of output 148 [2024-10-24 11:54:41,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:41,239 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 220 treesize of output 154 [2024-10-24 11:54:41,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:41,684 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 410 treesize of output 152 [2024-10-24 11:54:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 11:54:41,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:54:41,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:41,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973751501] [2024-10-24 11:54:41,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973751501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:54:41,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [138341288] [2024-10-24 11:54:41,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:54:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:54:41,949 INFO L229 MonitoredProcess]: Starting monitored process 24 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:54:41,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-10-24 11:54:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:42,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-24 11:54:42,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:42,773 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 8 treesize of output 4 [2024-10-24 11:54:45,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-24 11:54:50,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:50,681 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 118 treesize of output 61 [2024-10-24 11:54:50,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:50,768 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 118 treesize of output 61 [2024-10-24 11:54:50,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:50,785 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 128 treesize of output 88 [2024-10-24 11:54:50,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:50,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 192 treesize of output 128 [2024-10-24 11:54:51,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:51,119 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 69 treesize of output 75 [2024-10-24 11:54:51,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:51,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 211 treesize of output 87 [2024-10-24 11:54:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 11:54:51,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:54:51,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [138341288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:54:51,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:54:51,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-10-24 11:54:51,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760859696] [2024-10-24 11:54:51,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:54:51,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 11:54:51,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:51,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 11:54:51,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=667, Unknown=3, NotChecked=0, Total=812 [2024-10-24 11:54:51,560 INFO L87 Difference]: Start difference. First operand 583 states and 742 transitions. Second operand has 26 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 11:54:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:56,937 INFO L93 Difference]: Finished difference Result 1065 states and 1348 transitions. [2024-10-24 11:54:56,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 11:54:56,937 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 59 [2024-10-24 11:54:56,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:56,939 INFO L225 Difference]: With dead ends: 1065 [2024-10-24 11:54:56,940 INFO L226 Difference]: Without dead ends: 709 [2024-10-24 11:54:56,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=452, Invalid=1615, Unknown=3, NotChecked=0, Total=2070 [2024-10-24 11:54:56,941 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 321 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:56,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 581 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 11:54:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-10-24 11:54:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 447. [2024-10-24 11:54:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 410 states have (on average 1.2414634146341463) internal successors, (509), 410 states have internal predecessors, (509), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:54:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 557 transitions. [2024-10-24 11:54:56,986 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 557 transitions. Word has length 59 [2024-10-24 11:54:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:56,986 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 557 transitions. [2024-10-24 11:54:56,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 11:54:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 557 transitions. [2024-10-24 11:54:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 11:54:56,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:56,987 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:56,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-10-24 11:54:57,195 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 (23)] Forceful destruction successful, exit code 0 [2024-10-24 11:54:57,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /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:54:57,388 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:57,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:57,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2022919166, now seen corresponding path program 1 times [2024-10-24 11:54:57,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:57,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503791984] [2024-10-24 11:54:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:57,389 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:54:57,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:57,394 INFO L229 MonitoredProcess]: Starting monitored process 25 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:54:57,395 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 (25)] Waiting until timeout for monitored process [2024-10-24 11:54:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:57,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:54:57,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:57,630 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 20 treesize of output 21 [2024-10-24 11:55:00,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:55:00,166 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 150 treesize of output 65 [2024-10-24 11:55:00,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:55:00,229 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 150 treesize of output 65 [2024-10-24 11:55:00,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:55:00,304 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 214 treesize of output 116 [2024-10-24 11:55:00,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:55:00,424 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 188 treesize of output 134 [2024-10-24 11:55:00,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:55:00,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 378 treesize of output 150 [2024-10-24 11:55:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 11:55:00,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:55:01,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:55:01,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503791984] [2024-10-24 11:55:01,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503791984] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:55:01,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [99056222] [2024-10-24 11:55:01,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:55:01,221 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:55:01,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:55:01,223 INFO L229 MonitoredProcess]: Starting monitored process 26 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:55:01,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-10-24 11:55:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:55:02,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 11:55:02,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:55:02,121 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 8 treesize of output 4 [2024-10-24 11:55:04,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8