./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-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-79.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 f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:32:33,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:32:33,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:32:33,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:32:33,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:32:34,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:32:34,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:32:34,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:32:34,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:32:34,031 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:32:34,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:32:34,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:32:34,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:32:34,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:32:34,034 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:32:34,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:32:34,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:32:34,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:32:34,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:32:34,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:32:34,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:32:34,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:32:34,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:32:34,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:32:34,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:32:34,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:32:34,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:32:34,044 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:32:34,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:32:34,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:32:34,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:32:34,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:32:34,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:32:34,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:32:34,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:32:34,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:32:34,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:32:34,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:32:34,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:32:34,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:32:34,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:32:34,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:32:34,048 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 -> f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 [2024-10-13 06:32:34,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:32:34,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:32:34,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:32:34,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:32:34,335 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:32:34,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.i [2024-10-13 06:32:35,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:32:36,107 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:32:36,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.i [2024-10-13 06:32:36,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3650796b2/4f73af9e25d04ed591bddda014fcb0f3/FLAGada73e443 [2024-10-13 06:32:36,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3650796b2/4f73af9e25d04ed591bddda014fcb0f3 [2024-10-13 06:32:36,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:32:36,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:32:36,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:32:36,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:32:36,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:32:36,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3067af51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36, skipping insertion in model container [2024-10-13 06:32:36,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:32:36,423 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-79.i[916,929] [2024-10-13 06:32:36,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:32:36,490 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:32:36,502 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-79.i[916,929] [2024-10-13 06:32:36,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:32:36,571 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:32:36,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36 WrapperNode [2024-10-13 06:32:36,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:32:36,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:32:36,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:32:36,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:32:36,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,642 INFO L138 Inliner]: procedures = 29, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2024-10-13 06:32:36,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:32:36,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:32:36,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:32:36,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:32:36,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,696 INFO L175 MemorySlicer]: Split 103 memory accesses to 2 slices as follows [2, 101]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-13 06:32:36,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:32:36,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:32:36,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:32:36,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:32:36,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (1/1) ... [2024-10-13 06:32:36,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:32:36,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:32:36,784 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-13 06:32:36,787 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-13 06:32:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:32:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:32:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:32:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:32:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:32:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:32:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:32:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:32:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:32:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:32:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:32:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:32:36,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:32:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:32:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:32:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:32:36,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:32:36,981 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:32:36,984 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:32:37,545 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-13 06:32:37,546 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:32:37,592 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:32:37,592 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:32:37,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:32:37 BoogieIcfgContainer [2024-10-13 06:32:37,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:32:37,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:32:37,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:32:37,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:32:37,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:32:36" (1/3) ... [2024-10-13 06:32:37,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2498de27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:32:37, skipping insertion in model container [2024-10-13 06:32:37,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:36" (2/3) ... [2024-10-13 06:32:37,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2498de27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:32:37, skipping insertion in model container [2024-10-13 06:32:37,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:32:37" (3/3) ... [2024-10-13 06:32:37,604 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-79.i [2024-10-13 06:32:37,625 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:32:37,626 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:32:37,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:32:37,694 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;@5b166c59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:32:37,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:32:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:32:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-13 06:32:37,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:37,709 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:37,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:37,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:37,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1996609277, now seen corresponding path program 1 times [2024-10-13 06:32:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:37,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144431880] [2024-10-13 06:32:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:37,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:38,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:38,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144431880] [2024-10-13 06:32:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144431880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:38,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:38,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:32:38,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334571203] [2024-10-13 06:32:38,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:38,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:32:38,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:38,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:32:38,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:32:38,192 INFO L87 Difference]: Start difference. First operand has 88 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:32:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:38,229 INFO L93 Difference]: Finished difference Result 173 states and 271 transitions. [2024-10-13 06:32:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:32:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-10-13 06:32:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:38,238 INFO L225 Difference]: With dead ends: 173 [2024-10-13 06:32:38,239 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 06:32:38,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-13 06:32:38,247 INFO L432 NwaCegarLoop]: 122 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, 122 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-13 06:32:38,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:32:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 06:32:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 06:32:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:32:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-10-13 06:32:38,288 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 96 [2024-10-13 06:32:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:38,288 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-10-13 06:32:38,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:32:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-10-13 06:32:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-13 06:32:38,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:38,296 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:38,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:32:38,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:38,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:38,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1481260617, now seen corresponding path program 1 times [2024-10-13 06:32:38,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:38,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598147295] [2024-10-13 06:32:38,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:38,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:38,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:38,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598147295] [2024-10-13 06:32:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598147295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:38,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:38,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:32:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598139032] [2024-10-13 06:32:38,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:38,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:32:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:38,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:32:38,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:32:38,777 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:38,837 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-10-13 06:32:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:32:38,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-10-13 06:32:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:38,841 INFO L225 Difference]: With dead ends: 173 [2024-10-13 06:32:38,842 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 06:32:38,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-13 06:32:38,844 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 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-13 06:32:38,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:32:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 06:32:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 06:32:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:32:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-13 06:32:38,857 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 96 [2024-10-13 06:32:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:38,861 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-13 06:32:38,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-13 06:32:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:32:38,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:38,866 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:38,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:32:38,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash -517272324, now seen corresponding path program 1 times [2024-10-13 06:32:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:38,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925259203] [2024-10-13 06:32:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:39,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:39,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925259203] [2024-10-13 06:32:39,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925259203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:39,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:39,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:32:39,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019346942] [2024-10-13 06:32:39,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:39,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:32:39,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:39,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:32:39,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:32:39,132 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:39,183 INFO L93 Difference]: Finished difference Result 178 states and 259 transitions. [2024-10-13 06:32:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:32:39,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:32:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:39,185 INFO L225 Difference]: With dead ends: 178 [2024-10-13 06:32:39,185 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 06:32:39,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-13 06:32:39,188 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 353 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-13 06:32:39,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 353 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:32:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 06:32:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-13 06:32:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:32:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2024-10-13 06:32:39,200 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 98 [2024-10-13 06:32:39,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:39,201 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 130 transitions. [2024-10-13 06:32:39,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2024-10-13 06:32:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:32:39,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:39,204 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:39,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:32:39,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:39,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash -517212742, now seen corresponding path program 1 times [2024-10-13 06:32:39,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:39,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510011082] [2024-10-13 06:32:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:39,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:39,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:39,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510011082] [2024-10-13 06:32:39,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510011082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:39,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:39,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:32:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620941435] [2024-10-13 06:32:39,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:39,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:32:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:39,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:32:39,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:32:39,567 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:39,934 INFO L93 Difference]: Finished difference Result 258 states and 372 transitions. [2024-10-13 06:32:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:32:39,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:32:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:39,937 INFO L225 Difference]: With dead ends: 258 [2024-10-13 06:32:39,937 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 06:32:39,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:39,939 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 97 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:39,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 504 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:32:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 06:32:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 92. [2024-10-13 06:32:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 79 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:32:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-13 06:32:39,950 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 98 [2024-10-13 06:32:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:39,950 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-13 06:32:39,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-13 06:32:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:32:39,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:39,952 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:39,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:32:39,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:39,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1353715744, now seen corresponding path program 1 times [2024-10-13 06:32:39,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:39,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651760816] [2024-10-13 06:32:39,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:41,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651760816] [2024-10-13 06:32:41,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651760816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:41,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:41,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:32:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902493529] [2024-10-13 06:32:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:41,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:32:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:41,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:32:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:32:41,829 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:42,891 INFO L93 Difference]: Finished difference Result 476 states and 671 transitions. [2024-10-13 06:32:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 06:32:42,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-13 06:32:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:42,898 INFO L225 Difference]: With dead ends: 476 [2024-10-13 06:32:42,898 INFO L226 Difference]: Without dead ends: 385 [2024-10-13 06:32:42,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2024-10-13 06:32:42,903 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 768 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:42,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 634 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:32:42,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-13 06:32:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 199. [2024-10-13 06:32:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 174 states have (on average 1.4195402298850575) internal successors, (247), 174 states have internal predecessors, (247), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 06:32:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2024-10-13 06:32:42,945 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 99 [2024-10-13 06:32:42,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:42,945 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2024-10-13 06:32:42,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2024-10-13 06:32:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 06:32:42,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:42,948 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:42,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:32:42,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:42,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -974306402, now seen corresponding path program 1 times [2024-10-13 06:32:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915720530] [2024-10-13 06:32:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:44,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:44,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915720530] [2024-10-13 06:32:44,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915720530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:44,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:44,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:32:44,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609956292] [2024-10-13 06:32:44,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:44,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:32:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:44,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:32:44,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:44,210 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:44,490 INFO L93 Difference]: Finished difference Result 469 states and 680 transitions. [2024-10-13 06:32:44,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:32:44,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-13 06:32:44,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:44,494 INFO L225 Difference]: With dead ends: 469 [2024-10-13 06:32:44,494 INFO L226 Difference]: Without dead ends: 271 [2024-10-13 06:32:44,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:32:44,496 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 42 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:44,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 590 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-13 06:32:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 96. [2024-10-13 06:32:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:32:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-13 06:32:44,508 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 100 [2024-10-13 06:32:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:44,509 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-13 06:32:44,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-13 06:32:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:32:44,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:44,513 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:44,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:32:44,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:44,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1355690662, now seen corresponding path program 1 times [2024-10-13 06:32:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:44,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17811099] [2024-10-13 06:32:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:44,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:44,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17811099] [2024-10-13 06:32:44,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17811099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:44,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:44,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:32:44,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243023495] [2024-10-13 06:32:44,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:44,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:32:44,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:44,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:32:44,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:44,830 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:45,040 INFO L93 Difference]: Finished difference Result 254 states and 361 transitions. [2024-10-13 06:32:45,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:32:45,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-13 06:32:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:45,043 INFO L225 Difference]: With dead ends: 254 [2024-10-13 06:32:45,043 INFO L226 Difference]: Without dead ends: 159 [2024-10-13 06:32:45,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:32:45,044 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 55 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:45,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 480 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-13 06:32:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2024-10-13 06:32:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 139 states have internal predecessors, (191), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 221 transitions. [2024-10-13 06:32:45,053 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 221 transitions. Word has length 101 [2024-10-13 06:32:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:45,053 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 221 transitions. [2024-10-13 06:32:45,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 221 transitions. [2024-10-13 06:32:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:32:45,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:45,055 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:45,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:32:45,055 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:45,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:45,056 INFO L85 PathProgramCache]: Analyzing trace with hash -846571546, now seen corresponding path program 1 times [2024-10-13 06:32:45,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:45,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59344573] [2024-10-13 06:32:45,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:45,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:45,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59344573] [2024-10-13 06:32:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59344573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:45,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:45,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:32:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383388201] [2024-10-13 06:32:45,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:32:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:45,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:32:45,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:32:45,247 INFO L87 Difference]: Start difference. First operand 156 states and 221 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:45,335 INFO L93 Difference]: Finished difference Result 307 states and 435 transitions. [2024-10-13 06:32:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:32:45,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-13 06:32:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:45,338 INFO L225 Difference]: With dead ends: 307 [2024-10-13 06:32:45,338 INFO L226 Difference]: Without dead ends: 152 [2024-10-13 06:32:45,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-13 06:32:45,340 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:45,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:32:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-13 06:32:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-10-13 06:32:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 134 states have (on average 1.3507462686567164) internal successors, (181), 135 states have internal predecessors, (181), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 211 transitions. [2024-10-13 06:32:45,353 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 211 transitions. Word has length 101 [2024-10-13 06:32:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:45,354 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 211 transitions. [2024-10-13 06:32:45,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 211 transitions. [2024-10-13 06:32:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:32:45,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:45,356 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:45,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:32:45,357 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:45,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash 521156380, now seen corresponding path program 1 times [2024-10-13 06:32:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:45,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736876385] [2024-10-13 06:32:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:45,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:45,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736876385] [2024-10-13 06:32:45,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736876385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:45,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:45,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:32:45,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662438740] [2024-10-13 06:32:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:45,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:32:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:32:45,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:32:45,553 INFO L87 Difference]: Start difference. First operand 152 states and 211 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:45,638 INFO L93 Difference]: Finished difference Result 287 states and 399 transitions. [2024-10-13 06:32:45,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:32:45,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-13 06:32:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:45,640 INFO L225 Difference]: With dead ends: 287 [2024-10-13 06:32:45,640 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 06:32:45,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-13 06:32:45,641 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:45,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:32:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 06:32:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-13 06:32:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 119 states have internal predecessors, (157), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 187 transitions. [2024-10-13 06:32:45,649 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 187 transitions. Word has length 101 [2024-10-13 06:32:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:45,649 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 187 transitions. [2024-10-13 06:32:45,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 187 transitions. [2024-10-13 06:32:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 06:32:45,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:45,650 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:45,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:32:45,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:45,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:45,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2082241369, now seen corresponding path program 1 times [2024-10-13 06:32:45,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:45,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6926571] [2024-10-13 06:32:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:45,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:46,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:46,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6926571] [2024-10-13 06:32:46,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6926571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:46,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:46,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:32:46,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124860470] [2024-10-13 06:32:46,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:46,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:32:46,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:46,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:32:46,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:46,111 INFO L87 Difference]: Start difference. First operand 136 states and 187 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:32:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:46,343 INFO L93 Difference]: Finished difference Result 353 states and 483 transitions. [2024-10-13 06:32:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:32:46,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-10-13 06:32:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:46,346 INFO L225 Difference]: With dead ends: 353 [2024-10-13 06:32:46,346 INFO L226 Difference]: Without dead ends: 218 [2024-10-13 06:32:46,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-13 06:32:46,347 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 36 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:46,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 321 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-13 06:32:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 171. [2024-10-13 06:32:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 153 states have (on average 1.326797385620915) internal successors, (203), 154 states have internal predecessors, (203), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 233 transitions. [2024-10-13 06:32:46,356 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 233 transitions. Word has length 102 [2024-10-13 06:32:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:46,356 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 233 transitions. [2024-10-13 06:32:46,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:32:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 233 transitions. [2024-10-13 06:32:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 06:32:46,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:46,358 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:46,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:32:46,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:46,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1954560489, now seen corresponding path program 1 times [2024-10-13 06:32:46,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:46,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432774933] [2024-10-13 06:32:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:46,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 06:32:46,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:46,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432774933] [2024-10-13 06:32:46,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432774933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:46,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:46,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:32:46,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750446371] [2024-10-13 06:32:46,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:46,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:32:46,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:46,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:32:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:32:46,713 INFO L87 Difference]: Start difference. First operand 171 states and 233 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:32:47,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:47,015 INFO L93 Difference]: Finished difference Result 339 states and 462 transitions. [2024-10-13 06:32:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:32:47,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-10-13 06:32:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:47,017 INFO L225 Difference]: With dead ends: 339 [2024-10-13 06:32:47,017 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 06:32:47,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:32:47,018 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 81 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:47,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 236 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 06:32:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-10-13 06:32:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 148 states have (on average 1.3108108108108107) internal successors, (194), 149 states have internal predecessors, (194), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 224 transitions. [2024-10-13 06:32:47,027 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 224 transitions. Word has length 102 [2024-10-13 06:32:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:47,028 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 224 transitions. [2024-10-13 06:32:47,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:32:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 224 transitions. [2024-10-13 06:32:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:32:47,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:47,029 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:47,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:32:47,030 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:47,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1801410347, now seen corresponding path program 1 times [2024-10-13 06:32:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997307081] [2024-10-13 06:32:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:47,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997307081] [2024-10-13 06:32:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997307081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:47,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:32:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116344465] [2024-10-13 06:32:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:47,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:32:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:32:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:47,490 INFO L87 Difference]: Start difference. First operand 167 states and 224 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:32:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:47,669 INFO L93 Difference]: Finished difference Result 333 states and 447 transitions. [2024-10-13 06:32:47,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:32:47,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-13 06:32:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:47,672 INFO L225 Difference]: With dead ends: 333 [2024-10-13 06:32:47,673 INFO L226 Difference]: Without dead ends: 167 [2024-10-13 06:32:47,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:32:47,674 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 98 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:47,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 168 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-13 06:32:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-10-13 06:32:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 149 states have internal predecessors, (190), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 220 transitions. [2024-10-13 06:32:47,686 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 220 transitions. Word has length 103 [2024-10-13 06:32:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:47,687 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 220 transitions. [2024-10-13 06:32:47,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:32:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 220 transitions. [2024-10-13 06:32:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:32:47,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:47,688 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:47,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:32:47,689 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:47,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash 808450374, now seen corresponding path program 1 times [2024-10-13 06:32:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:47,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320537543] [2024-10-13 06:32:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:47,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:32:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [193790522] [2024-10-13 06:32:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:47,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:32:47,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:32:47,753 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-13 06:32:47,754 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-13 06:32:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:48,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 06:32:48,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:48,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:48,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:48,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:48,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:48,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:48,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:48,230 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 35 treesize of output 19 [2024-10-13 06:32:48,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:48,260 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 35 treesize of output 37 [2024-10-13 06:32:48,315 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 110 treesize of output 84 [2024-10-13 06:32:48,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:48,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 124 [2024-10-13 06:32:48,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:32:48,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 49 [2024-10-13 06:32:48,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:48,844 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 135 treesize of output 61 [2024-10-13 06:32:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:48,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:48,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:48,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320537543] [2024-10-13 06:32:48,915 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:32:48,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193790522] [2024-10-13 06:32:48,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193790522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:48,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:48,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:32:48,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538143724] [2024-10-13 06:32:48,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:48,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:32:48,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:48,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:32:48,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:32:48,918 INFO L87 Difference]: Start difference. First operand 167 states and 220 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:49,727 INFO L93 Difference]: Finished difference Result 411 states and 540 transitions. [2024-10-13 06:32:49,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:32:49,729 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-13 06:32:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:49,730 INFO L225 Difference]: With dead ends: 411 [2024-10-13 06:32:49,731 INFO L226 Difference]: Without dead ends: 245 [2024-10-13 06:32:49,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:32:49,732 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 34 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:49,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 835 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:32:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-13 06:32:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2024-10-13 06:32:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 182 states have (on average 1.2747252747252746) internal successors, (232), 183 states have internal predecessors, (232), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 262 transitions. [2024-10-13 06:32:49,744 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 262 transitions. Word has length 105 [2024-10-13 06:32:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:49,745 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 262 transitions. [2024-10-13 06:32:49,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 262 transitions. [2024-10-13 06:32:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:32:49,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:49,747 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:49,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:32:49,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 06:32:49,948 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:49,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:49,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1059758026, now seen corresponding path program 1 times [2024-10-13 06:32:49,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:49,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847301096] [2024-10-13 06:32:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:32:50,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71855738] [2024-10-13 06:32:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:50,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:32:50,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:32:50,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:32:50,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 06:32:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:50,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-13 06:32:50,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:50,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:50,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:50,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:50,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:50,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:50,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:50,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:50,418 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 39 treesize of output 26 [2024-10-13 06:32:50,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:50,436 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 39 treesize of output 44 [2024-10-13 06:32:50,472 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 114 treesize of output 86 [2024-10-13 06:32:50,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:50,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 136 [2024-10-13 06:32:50,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2024-10-13 06:32:50,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:50,953 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 152 treesize of output 60 [2024-10-13 06:32:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:50,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:50,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:50,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847301096] [2024-10-13 06:32:50,998 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:32:50,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71855738] [2024-10-13 06:32:50,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71855738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:50,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:50,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:32:51,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182832824] [2024-10-13 06:32:51,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:51,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:32:51,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:51,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:32:51,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:32:51,002 INFO L87 Difference]: Start difference. First operand 201 states and 262 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:51,709 INFO L93 Difference]: Finished difference Result 487 states and 638 transitions. [2024-10-13 06:32:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:32:51,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-13 06:32:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:51,713 INFO L225 Difference]: With dead ends: 487 [2024-10-13 06:32:51,713 INFO L226 Difference]: Without dead ends: 287 [2024-10-13 06:32:51,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:32:51,715 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 72 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:51,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 685 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:32:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-13 06:32:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2024-10-13 06:32:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 210 states have (on average 1.276190476190476) internal successors, (268), 211 states have internal predecessors, (268), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 298 transitions. [2024-10-13 06:32:51,728 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 298 transitions. Word has length 105 [2024-10-13 06:32:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:51,729 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 298 transitions. [2024-10-13 06:32:51,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 298 transitions. [2024-10-13 06:32:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:32:51,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:51,731 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:51,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 06:32:51,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 06:32:51,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:51,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:51,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1317923464, now seen corresponding path program 1 times [2024-10-13 06:32:51,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:51,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274592918] [2024-10-13 06:32:51,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:51,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:52,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:52,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274592918] [2024-10-13 06:32:52,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274592918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:52,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:52,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:32:52,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097684062] [2024-10-13 06:32:52,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:52,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:32:52,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:52,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:32:52,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:32:52,576 INFO L87 Difference]: Start difference. First operand 229 states and 298 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:52,779 INFO L93 Difference]: Finished difference Result 510 states and 665 transitions. [2024-10-13 06:32:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:32:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-13 06:32:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:52,782 INFO L225 Difference]: With dead ends: 510 [2024-10-13 06:32:52,782 INFO L226 Difference]: Without dead ends: 282 [2024-10-13 06:32:52,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:52,785 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 32 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:52,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 374 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-13 06:32:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 229. [2024-10-13 06:32:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 210 states have (on average 1.2571428571428571) internal successors, (264), 211 states have internal predecessors, (264), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 294 transitions. [2024-10-13 06:32:52,799 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 294 transitions. Word has length 105 [2024-10-13 06:32:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:52,803 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 294 transitions. [2024-10-13 06:32:52,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 294 transitions. [2024-10-13 06:32:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:32:52,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:52,805 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:52,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:32:52,805 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:52,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:52,805 INFO L85 PathProgramCache]: Analyzing trace with hash -453486732, now seen corresponding path program 1 times [2024-10-13 06:32:52,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:52,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751034068] [2024-10-13 06:32:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:52,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:32:52,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690308963] [2024-10-13 06:32:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:52,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:32:52,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:32:52,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:32:52,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 06:32:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:53,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 06:32:53,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:53,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:53,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:53,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:53,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:53,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:53,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:53,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-13 06:32:53,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:53,282 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-13 06:32:53,316 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 112 treesize of output 86 [2024-10-13 06:32:53,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:53,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 126 [2024-10-13 06:32:53,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:32:53,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 52 [2024-10-13 06:32:53,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:53,801 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 139 treesize of output 65 [2024-10-13 06:32:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:53,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:53,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:53,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751034068] [2024-10-13 06:32:53,860 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:32:53,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690308963] [2024-10-13 06:32:53,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690308963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:53,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:53,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:32:53,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124014249] [2024-10-13 06:32:53,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:53,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:32:53,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:53,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:32:53,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:32:53,863 INFO L87 Difference]: Start difference. First operand 229 states and 294 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:54,321 INFO L93 Difference]: Finished difference Result 497 states and 637 transitions. [2024-10-13 06:32:54,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:32:54,323 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-13 06:32:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:54,325 INFO L225 Difference]: With dead ends: 497 [2024-10-13 06:32:54,325 INFO L226 Difference]: Without dead ends: 269 [2024-10-13 06:32:54,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:32:54,326 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 66 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:54,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 516 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:32:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-13 06:32:54,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 245. [2024-10-13 06:32:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 226 states have (on average 1.252212389380531) internal successors, (283), 227 states have internal predecessors, (283), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 313 transitions. [2024-10-13 06:32:54,341 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 313 transitions. Word has length 106 [2024-10-13 06:32:54,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:54,342 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 313 transitions. [2024-10-13 06:32:54,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 313 transitions. [2024-10-13 06:32:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:32:54,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:54,344 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:54,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 06:32:54,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:32:54,548 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:54,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:54,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1387051561, now seen corresponding path program 1 times [2024-10-13 06:32:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:54,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141932721] [2024-10-13 06:32:54,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:55,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:55,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141932721] [2024-10-13 06:32:55,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141932721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:55,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:55,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:32:55,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516454426] [2024-10-13 06:32:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:55,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:32:55,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:55,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:32:55,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:32:55,224 INFO L87 Difference]: Start difference. First operand 245 states and 313 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:32:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:55,485 INFO L93 Difference]: Finished difference Result 251 states and 320 transitions. [2024-10-13 06:32:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:32:55,486 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-10-13 06:32:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:55,487 INFO L225 Difference]: With dead ends: 251 [2024-10-13 06:32:55,487 INFO L226 Difference]: Without dead ends: 249 [2024-10-13 06:32:55,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:32:55,489 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 69 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:55,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 327 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-13 06:32:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2024-10-13 06:32:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 230 states have (on average 1.2478260869565216) internal successors, (287), 231 states have internal predecessors, (287), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 317 transitions. [2024-10-13 06:32:55,499 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 317 transitions. Word has length 106 [2024-10-13 06:32:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:55,500 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 317 transitions. [2024-10-13 06:32:55,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:32:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 317 transitions. [2024-10-13 06:32:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:32:55,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:55,501 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:55,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:32:55,502 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:55,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1387111143, now seen corresponding path program 1 times [2024-10-13 06:32:55,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:55,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97582152] [2024-10-13 06:32:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:55,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:55,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97582152] [2024-10-13 06:32:55,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97582152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:55,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:55,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:32:55,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427864219] [2024-10-13 06:32:55,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:55,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:32:55,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:55,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:32:55,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:32:55,644 INFO L87 Difference]: Start difference. First operand 249 states and 317 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:55,679 INFO L93 Difference]: Finished difference Result 503 states and 641 transitions. [2024-10-13 06:32:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:32:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-13 06:32:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:55,681 INFO L225 Difference]: With dead ends: 503 [2024-10-13 06:32:55,681 INFO L226 Difference]: Without dead ends: 255 [2024-10-13 06:32:55,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-13 06:32:55,682 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:55,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 423 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:32:55,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-13 06:32:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-10-13 06:32:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 236 states have (on average 1.2415254237288136) internal successors, (293), 237 states have internal predecessors, (293), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 323 transitions. [2024-10-13 06:32:55,692 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 323 transitions. Word has length 106 [2024-10-13 06:32:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:55,692 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 323 transitions. [2024-10-13 06:32:55,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 323 transitions. [2024-10-13 06:32:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:32:55,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:55,694 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:55,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:32:55,694 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:55,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash -554314996, now seen corresponding path program 1 times [2024-10-13 06:32:55,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:55,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237448647] [2024-10-13 06:32:55,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:55,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:55,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:55,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237448647] [2024-10-13 06:32:55,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237448647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:55,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:55,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:32:55,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128430451] [2024-10-13 06:32:55,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:55,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:32:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:55,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:32:55,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:32:55,957 INFO L87 Difference]: Start difference. First operand 255 states and 323 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:56,144 INFO L93 Difference]: Finished difference Result 574 states and 725 transitions. [2024-10-13 06:32:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:32:56,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-13 06:32:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:56,147 INFO L225 Difference]: With dead ends: 574 [2024-10-13 06:32:56,147 INFO L226 Difference]: Without dead ends: 320 [2024-10-13 06:32:56,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:56,148 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 27 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:56,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 285 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-13 06:32:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 270. [2024-10-13 06:32:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 251 states have (on average 1.2231075697211156) internal successors, (307), 252 states have internal predecessors, (307), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 337 transitions. [2024-10-13 06:32:56,162 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 337 transitions. Word has length 106 [2024-10-13 06:32:56,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:56,162 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 337 transitions. [2024-10-13 06:32:56,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 337 transitions. [2024-10-13 06:32:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:32:56,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:56,164 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:56,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:32:56,164 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:56,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash 86181508, now seen corresponding path program 1 times [2024-10-13 06:32:56,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:56,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248617663] [2024-10-13 06:32:56,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:32:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:32:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:32:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:32:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:56,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:56,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248617663] [2024-10-13 06:32:56,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248617663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:56,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:56,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:32:56,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664819989] [2024-10-13 06:32:56,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:56,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:32:56,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:56,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:32:56,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:32:56,454 INFO L87 Difference]: Start difference. First operand 270 states and 337 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:56,675 INFO L93 Difference]: Finished difference Result 589 states and 735 transitions. [2024-10-13 06:32:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:32:56,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-13 06:32:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:56,679 INFO L225 Difference]: With dead ends: 589 [2024-10-13 06:32:56,679 INFO L226 Difference]: Without dead ends: 320 [2024-10-13 06:32:56,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:56,681 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 28 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:56,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 368 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:32:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-13 06:32:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 270. [2024-10-13 06:32:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 251 states have (on average 1.2151394422310757) internal successors, (305), 252 states have internal predecessors, (305), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 335 transitions. [2024-10-13 06:32:56,699 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 335 transitions. Word has length 106 [2024-10-13 06:32:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:56,700 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 335 transitions. [2024-10-13 06:32:56,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:56,700 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 335 transitions. [2024-10-13 06:32:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:32:56,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:56,703 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:56,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 06:32:56,703 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:56,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash -828572876, now seen corresponding path program 1 times [2024-10-13 06:32:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:56,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360910252] [2024-10-13 06:32:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:56,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:32:56,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48858065] [2024-10-13 06:32:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:56,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:32:56,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:32:56,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:32:56,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 06:32:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:57,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 06:32:57,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:57,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:57,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:57,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:57,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:57,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:57,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:32:57,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:57,156 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 41 treesize of output 28 [2024-10-13 06:32:57,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:57,183 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 41 treesize of output 46 [2024-10-13 06:32:57,222 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 116 treesize of output 88 [2024-10-13 06:32:57,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:57,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 138 [2024-10-13 06:32:57,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:32:57,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 61 [2024-10-13 06:32:57,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:57,676 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 156 treesize of output 64 [2024-10-13 06:32:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:32:57,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:57,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:57,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360910252] [2024-10-13 06:32:57,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:32:57,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48858065] [2024-10-13 06:32:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48858065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:57,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:57,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:32:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8842444] [2024-10-13 06:32:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:57,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:32:57,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:57,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:32:57,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:32:57,728 INFO L87 Difference]: Start difference. First operand 270 states and 335 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:58,202 INFO L93 Difference]: Finished difference Result 560 states and 694 transitions. [2024-10-13 06:32:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:32:58,204 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-13 06:32:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:58,205 INFO L225 Difference]: With dead ends: 560 [2024-10-13 06:32:58,205 INFO L226 Difference]: Without dead ends: 291 [2024-10-13 06:32:58,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:32:58,207 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 44 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:58,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 642 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:32:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-13 06:32:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 268. [2024-10-13 06:32:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 249 states have (on average 1.216867469879518) internal successors, (303), 250 states have internal predecessors, (303), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:32:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 333 transitions. [2024-10-13 06:32:58,220 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 333 transitions. Word has length 106 [2024-10-13 06:32:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:58,220 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 333 transitions. [2024-10-13 06:32:58,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:32:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 333 transitions. [2024-10-13 06:32:58,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 06:32:58,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:58,222 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:32:58,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 06:32:58,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:32:58,427 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:58,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:58,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1401082657, now seen corresponding path program 1 times [2024-10-13 06:32:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:58,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016150878] [2024-10-13 06:32:58,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:32:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1433372289] [2024-10-13 06:32:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:58,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:32:58,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:32:58,489 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:32:58,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 06:32:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:32:58,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:32:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:32:59,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:32:59,192 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:32:59,199 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:32:59,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 06:32:59,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 06:32:59,405 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:59,480 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:32:59,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:32:59 BoogieIcfgContainer [2024-10-13 06:32:59,483 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:32:59,483 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:32:59,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:32:59,484 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:32:59,484 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:32:37" (3/4) ... [2024-10-13 06:32:59,486 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:32:59,487 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:32:59,487 INFO L158 Benchmark]: Toolchain (without parser) took 23318.54ms. Allocated memory was 192.9MB in the beginning and 497.0MB in the end (delta: 304.1MB). Free memory was 163.9MB in the beginning and 419.7MB in the end (delta: -255.8MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-10-13 06:32:59,488 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory was 103.9MB in the beginning and 103.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:32:59,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.94ms. Allocated memory is still 192.9MB. Free memory was 163.7MB in the beginning and 150.8MB in the end (delta: 12.9MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-10-13 06:32:59,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.42ms. Allocated memory is still 192.9MB. Free memory was 150.8MB in the beginning and 147.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:32:59,488 INFO L158 Benchmark]: Boogie Preprocessor took 99.47ms. Allocated memory is still 192.9MB. Free memory was 147.4MB in the beginning and 143.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:32:59,489 INFO L158 Benchmark]: RCFGBuilder took 849.18ms. Allocated memory is still 192.9MB. Free memory was 143.7MB in the beginning and 111.8MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 06:32:59,489 INFO L158 Benchmark]: TraceAbstraction took 21887.46ms. Allocated memory was 192.9MB in the beginning and 497.0MB in the end (delta: 304.1MB). Free memory was 111.0MB in the beginning and 419.7MB in the end (delta: -308.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:32:59,489 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 497.0MB. Free memory is still 419.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:32:59,492 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory was 103.9MB in the beginning and 103.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.94ms. Allocated memory is still 192.9MB. Free memory was 163.7MB in the beginning and 150.8MB in the end (delta: 12.9MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.42ms. Allocated memory is still 192.9MB. Free memory was 150.8MB in the beginning and 147.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.47ms. Allocated memory is still 192.9MB. Free memory was 147.4MB in the beginning and 143.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 849.18ms. Allocated memory is still 192.9MB. Free memory was 143.7MB in the beginning and 111.8MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21887.46ms. Allocated memory was 192.9MB in the beginning and 497.0MB in the end (delta: 304.1MB). Free memory was 111.0MB in the beginning and 419.7MB in the end (delta: -308.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 497.0MB. Free memory is still 419.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 95. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L49] unsigned short int last_1_WrapperStruct00_var_1_10 = 32; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] EXPR WrapperStruct00.var_1_10 [L101] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L81] WrapperStruct00.var_1_3 = __VERIFIER_nondet_char() [L82] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L83] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L84] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L86] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L87] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L89] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L90] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_8 [L91] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L91] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_8 [L91] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L91] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L91] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L92] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L93] EXPR WrapperStruct00.var_1_9 [L93] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L93] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_9 [L93] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L93] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L93] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L94] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_11 [L95] EXPR WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L95] EXPR WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_11 [L95] EXPR WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L95] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L95] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L96] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L98] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L112] RET updateVariables() [L113] CALL step() [L53] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L53] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) [L53] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L53] signed long int stepLocal_0 = (((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10)); [L54] EXPR WrapperStruct00.var_1_4 [L54] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L54] EXPR last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32, stepLocal_0=32] [L54] COND TRUE stepLocal_0 <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3)) [L55] EXPR WrapperStruct00.var_1_8 [L55] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L55] COND FALSE !((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) [L58] EXPR WrapperStruct00.var_1_5 [L58] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_5 [L63] EXPR WrapperStruct00.var_1_5 [L63] EXPR WrapperStruct00.var_1_6 [L63] signed long int stepLocal_1 = WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6; [L64] EXPR WrapperStruct00.var_1_11 [L64] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L64] COND FALSE !(WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) [L71] EXPR WrapperStruct00.var_1_13 [L71] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_13 [L72] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L72] COND TRUE ! WrapperStruct00.var_1_12 [L73] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L73] COND TRUE ! WrapperStruct00.var_1_12 [L74] EXPR WrapperStruct00.var_1_3 [L74] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_3 + -32) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1 [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16)))))) [L104] EXPR WrapperStruct00.var_1_1 [L104] EXPR WrapperStruct00.var_1_3 [L104] EXPR (! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) [L104] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR WrapperStruct00.var_1_4 [L104] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR WrapperStruct00.var_1_4 [L104] EXPR ((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)))) && ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) ? (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) <= (~ (WrapperStruct00.var_1_6 % -32))) ? (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)))) && ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) ? (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) <= (~ (WrapperStruct00.var_1_6 % -32))) ? (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)))) && ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) ? (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) <= (~ (WrapperStruct00.var_1_6 % -32))) ? (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5))) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)))) && ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) ? (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) <= (~ (WrapperStruct00.var_1_6 % -32))) ? (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5))) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104-L105] return ((((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)))) && ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) ? (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) <= (~ (WrapperStruct00.var_1_6 % -32))) ? (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5))) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13)) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.7s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1562 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1550 mSDsluCounter, 8796 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6557 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5250 IncrementalHoareTripleChecker+Invalid, 5428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 2239 mSDtfsCounter, 5250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 996 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=19, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 793 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 2784 NumberOfCodeBlocks, 2784 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2127 ConstructedInterpolants, 0 QuantifiedInterpolants, 9186 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1464 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 4620/4620 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-13 06:32:59,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.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 f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:33:01,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:33:02,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:33:02,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:33:02,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:33:02,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:33:02,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:33:02,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:33:02,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:33:02,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:33:02,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:33:02,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:33:02,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:33:02,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:33:02,074 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:33:02,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:33:02,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:33:02,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:33:02,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:33:02,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:33:02,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:33:02,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:33:02,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:33:02,079 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:33:02,079 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:33:02,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:33:02,079 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:33:02,080 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:33:02,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:33:02,080 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:33:02,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:33:02,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:33:02,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:33:02,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:33:02,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:33:02,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:33:02,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:33:02,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:33:02,083 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:33:02,083 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:33:02,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:33:02,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:33:02,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:33:02,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:33:02,086 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:33:02,086 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 -> f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 [2024-10-13 06:33:02,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:33:02,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:33:02,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:33:02,440 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:33:02,440 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:33:02,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.i [2024-10-13 06:33:04,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:33:04,350 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:33:04,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.i [2024-10-13 06:33:04,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a354b599/10d9c5ae609c40f69808085502b86a4e/FLAG78a863b0f [2024-10-13 06:33:04,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a354b599/10d9c5ae609c40f69808085502b86a4e [2024-10-13 06:33:04,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:33:04,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:33:04,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:33:04,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:33:04,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:33:04,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:04,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591e36ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04, skipping insertion in model container [2024-10-13 06:33:04,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:04,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:33:04,635 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-79.i[916,929] [2024-10-13 06:33:04,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:33:04,731 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:33:04,744 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-79.i[916,929] [2024-10-13 06:33:04,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:33:04,839 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:33:04,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04 WrapperNode [2024-10-13 06:33:04,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:33:04,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:33:04,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:33:04,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:33:04,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:04,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:04,923 INFO L138 Inliner]: procedures = 39, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 386 [2024-10-13 06:33:04,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:33:04,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:33:04,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:33:04,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:33:04,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:04,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:04,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:04,986 INFO L175 MemorySlicer]: Split 103 memory accesses to 2 slices as follows [2, 101]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-13 06:33:04,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:04,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:05,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:05,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:05,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:05,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:05,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:33:05,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:33:05,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:33:05,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:33:05,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (1/1) ... [2024-10-13 06:33:05,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:33:05,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:05,083 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-13 06:33:05,085 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-13 06:33:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:33:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:33:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:33:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:33:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:33:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:33:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:33:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:33:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:33:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:33:05,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:33:05,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:33:05,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:33:05,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:33:05,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:33:05,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:33:05,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:33:05,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:33:05,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:33:05,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:33:05,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:33:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:33:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:33:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:33:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:33:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:33:05,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:33:05,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:33:05,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:33:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:33:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:33:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:33:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:33:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:33:05,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:33:05,283 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:33:05,285 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:33:06,334 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-13 06:33:06,335 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:33:06,397 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:33:06,398 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:33:06,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:06 BoogieIcfgContainer [2024-10-13 06:33:06,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:33:06,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:33:06,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:33:06,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:33:06,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:33:04" (1/3) ... [2024-10-13 06:33:06,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213a8db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:06, skipping insertion in model container [2024-10-13 06:33:06,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:04" (2/3) ... [2024-10-13 06:33:06,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213a8db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:06, skipping insertion in model container [2024-10-13 06:33:06,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:06" (3/3) ... [2024-10-13 06:33:06,412 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-79.i [2024-10-13 06:33:06,428 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:33:06,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:33:06,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:33:06,492 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;@7e897ac5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:33:06,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:33:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:33:06,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:06,509 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:06,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:06,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1192607984, now seen corresponding path program 1 times [2024-10-13 06:33:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:06,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579426092] [2024-10-13 06:33:06,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:06,554 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-13 06:33:06,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:06,558 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-13 06:33:06,560 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-13 06:33:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:33:06,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-13 06:33:06,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:06,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:06,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579426092] [2024-10-13 06:33:06,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579426092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:06,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:06,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:33:06,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731836162] [2024-10-13 06:33:06,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:06,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:33:06,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:06,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:33:06,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:33:06,918 INFO L87 Difference]: Start difference. First operand has 84 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:06,975 INFO L93 Difference]: Finished difference Result 165 states and 259 transitions. [2024-10-13 06:33:06,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:33:06,979 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2024-10-13 06:33:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:06,986 INFO L225 Difference]: With dead ends: 165 [2024-10-13 06:33:06,986 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 06:33:06,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 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-13 06:33:06,994 INFO L432 NwaCegarLoop]: 116 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, 116 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-13 06:33:06,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 06:33:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-13 06:33:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2024-10-13 06:33:07,047 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 95 [2024-10-13 06:33:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:07,048 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2024-10-13 06:33:07,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2024-10-13 06:33:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:33:07,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:07,051 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:07,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:07,256 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-13 06:33:07,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:07,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1690528010, now seen corresponding path program 1 times [2024-10-13 06:33:07,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:07,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955335189] [2024-10-13 06:33:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:07,260 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-13 06:33:07,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:07,263 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-13 06:33:07,264 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-13 06:33:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:07,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:33:07,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:07,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:07,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:07,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955335189] [2024-10-13 06:33:07,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955335189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:07,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:07,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730279064] [2024-10-13 06:33:07,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:07,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:07,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:07,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:07,597 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:07,654 INFO L93 Difference]: Finished difference Result 165 states and 242 transitions. [2024-10-13 06:33:07,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:07,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2024-10-13 06:33:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:07,656 INFO L225 Difference]: With dead ends: 165 [2024-10-13 06:33:07,656 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 06:33:07,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 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-13 06:33:07,658 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 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-13 06:33:07,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 06:33:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 06:33:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-10-13 06:33:07,669 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 95 [2024-10-13 06:33:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:07,671 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-10-13 06:33:07,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-10-13 06:33:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 06:33:07,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:07,674 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:07,684 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-13 06:33:07,874 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-13 06:33:07,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:07,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:07,878 INFO L85 PathProgramCache]: Analyzing trace with hash -902648421, now seen corresponding path program 1 times [2024-10-13 06:33:07,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:07,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185125961] [2024-10-13 06:33:07,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:07,879 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-13 06:33:07,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:07,883 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-13 06:33:07,884 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-13 06:33:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:08,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:33:08,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:08,207 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-13 06:33:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:08,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:08,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:08,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185125961] [2024-10-13 06:33:08,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185125961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:08,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:08,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:08,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482666719] [2024-10-13 06:33:08,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:08,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:08,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:08,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:08,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:08,290 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:12,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:12,368 INFO L93 Difference]: Finished difference Result 240 states and 348 transitions. [2024-10-13 06:33:12,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:12,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-10-13 06:33:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:12,371 INFO L225 Difference]: With dead ends: 240 [2024-10-13 06:33:12,371 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 06:33:12,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 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-13 06:33:12,375 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 91 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:12,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 471 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-13 06:33:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 06:33:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 86. [2024-10-13 06:33:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2024-10-13 06:33:12,387 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 97 [2024-10-13 06:33:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:12,387 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2024-10-13 06:33:12,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2024-10-13 06:33:12,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:33:12,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:12,391 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:12,398 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-13 06:33:12,591 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-13 06:33:12,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:12,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash -182811812, now seen corresponding path program 1 times [2024-10-13 06:33:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:12,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702141135] [2024-10-13 06:33:12,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:12,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-13 06:33:12,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:12,597 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-13 06:33:12,598 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-13 06:33:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:12,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:33:12,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:12,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:12,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:12,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702141135] [2024-10-13 06:33:12,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702141135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:12,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:12,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263266226] [2024-10-13 06:33:12,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:12,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:12,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:12,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:12,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:12,829 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:12,892 INFO L93 Difference]: Finished difference Result 176 states and 254 transitions. [2024-10-13 06:33:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:12,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:33:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:12,894 INFO L225 Difference]: With dead ends: 176 [2024-10-13 06:33:12,894 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 06:33:12,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 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-13 06:33:12,895 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:12,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 438 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:33:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 06:33:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-13 06:33:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2024-10-13 06:33:12,903 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 98 [2024-10-13 06:33:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:12,904 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2024-10-13 06:33:12,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2024-10-13 06:33:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:33:12,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:12,906 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:12,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 06:33:13,110 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-13 06:33:13,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash -182752230, now seen corresponding path program 1 times [2024-10-13 06:33:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:13,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631037846] [2024-10-13 06:33:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:13,113 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-13 06:33:13,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:13,116 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-13 06:33:13,117 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-13 06:33:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 06:33:13,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:13,401 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-13 06:33:13,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-10-13 06:33:13,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:13,784 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 52 treesize of output 33 [2024-10-13 06:33:13,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:13,976 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 58 treesize of output 43 [2024-10-13 06:33:16,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:16,021 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 73 treesize of output 46 [2024-10-13 06:33:16,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:16,180 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 62 treesize of output 46 [2024-10-13 06:33:16,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:16,347 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 62 treesize of output 46 [2024-10-13 06:33:16,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:16,627 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-13 06:33:16,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:16,774 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 81 treesize of output 89 [2024-10-13 06:33:16,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:16,929 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 100 treesize of output 105 [2024-10-13 06:33:17,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:17,174 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 148 treesize of output 70 [2024-10-13 06:33:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 54 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 06:33:17,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:33:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:17,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:17,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631037846] [2024-10-13 06:33:17,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631037846] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:33:17,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:33:17,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 21 [2024-10-13 06:33:17,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638048179] [2024-10-13 06:33:17,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:17,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:17,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=351, Unknown=1, NotChecked=0, Total=420 [2024-10-13 06:33:17,496 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:18,152 INFO L93 Difference]: Finished difference Result 216 states and 304 transitions. [2024-10-13 06:33:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:33:18,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-13 06:33:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:18,155 INFO L225 Difference]: With dead ends: 216 [2024-10-13 06:33:18,155 INFO L226 Difference]: Without dead ends: 127 [2024-10-13 06:33:18,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=80, Invalid=471, Unknown=1, NotChecked=0, Total=552 [2024-10-13 06:33:18,156 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 39 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:18,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 548 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:33:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-13 06:33:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 94. [2024-10-13 06:33:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.382716049382716) internal successors, (112), 81 states have internal predecessors, (112), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-10-13 06:33:18,165 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 98 [2024-10-13 06:33:18,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:18,165 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-10-13 06:33:18,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-10-13 06:33:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:33:18,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:18,168 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:18,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 06:33:18,368 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-13 06:33:18,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:18,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:18,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1566865573, now seen corresponding path program 1 times [2024-10-13 06:33:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:18,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024515831] [2024-10-13 06:33:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:18,370 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-13 06:33:18,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:18,373 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-13 06:33:18,374 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-13 06:33:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:33:18,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:18,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:33:18,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:18,693 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 33 treesize of output 35 [2024-10-13 06:33:18,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:18,744 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 41 treesize of output 17 [2024-10-13 06:33:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 06:33:18,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:18,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:18,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024515831] [2024-10-13 06:33:18,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024515831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:18,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:18,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:33:18,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177494844] [2024-10-13 06:33:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:18,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:33:18,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:18,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:33:18,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:33:18,772 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:20,000 INFO L93 Difference]: Finished difference Result 249 states and 349 transitions. [2024-10-13 06:33:20,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 06:33:20,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-10-13 06:33:20,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:20,002 INFO L225 Difference]: With dead ends: 249 [2024-10-13 06:33:20,002 INFO L226 Difference]: Without dead ends: 156 [2024-10-13 06:33:20,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:33:20,003 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 182 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:20,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 281 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 06:33:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-13 06:33:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2024-10-13 06:33:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 133 states have internal predecessors, (180), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:33:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 210 transitions. [2024-10-13 06:33:20,026 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 210 transitions. Word has length 99 [2024-10-13 06:33:20,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:20,027 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 210 transitions. [2024-10-13 06:33:20,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:20,027 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 210 transitions. [2024-10-13 06:33:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 06:33:20,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:20,029 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:20,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 (7)] Ended with exit code 0 [2024-10-13 06:33:20,230 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-13 06:33:20,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:20,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1974940480, now seen corresponding path program 1 times [2024-10-13 06:33:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:20,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397947006] [2024-10-13 06:33:20,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:20,232 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-13 06:33:20,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:20,235 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-13 06:33:20,235 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-13 06:33:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:33:20,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:20,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:20,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:20,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397947006] [2024-10-13 06:33:20,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397947006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:20,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:20,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:20,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304558136] [2024-10-13 06:33:20,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:20,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:20,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:20,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:20,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:20,429 INFO L87 Difference]: Start difference. First operand 151 states and 210 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:20,780 INFO L93 Difference]: Finished difference Result 297 states and 413 transitions. [2024-10-13 06:33:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:20,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-13 06:33:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:20,784 INFO L225 Difference]: With dead ends: 297 [2024-10-13 06:33:20,784 INFO L226 Difference]: Without dead ends: 147 [2024-10-13 06:33:20,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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-13 06:33:20,786 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:20,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:33:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-13 06:33:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-13 06:33:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.328125) internal successors, (170), 129 states have internal predecessors, (170), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:33:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 200 transitions. [2024-10-13 06:33:20,801 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 200 transitions. Word has length 100 [2024-10-13 06:33:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:20,802 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 200 transitions. [2024-10-13 06:33:20,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 200 transitions. [2024-10-13 06:33:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 06:33:20,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:20,804 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:20,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 06:33:21,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:21,005 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:21,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1840112166, now seen corresponding path program 1 times [2024-10-13 06:33:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:21,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430596816] [2024-10-13 06:33:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:21,006 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-13 06:33:21,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:21,009 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:33:21,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 06:33:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:21,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 06:33:21,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:21,245 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-13 06:33:21,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:21,297 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 33 treesize of output 35 [2024-10-13 06:33:21,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:21,357 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 49 [2024-10-13 06:33:21,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:21,418 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 69 treesize of output 74 [2024-10-13 06:33:21,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:21,481 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 75 treesize of output 29 [2024-10-13 06:33:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 06:33:21,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:21,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:21,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430596816] [2024-10-13 06:33:21,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430596816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:21,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:21,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:33:21,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675062910] [2024-10-13 06:33:21,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:21,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:33:21,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:21,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:33:21,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:33:21,516 INFO L87 Difference]: Start difference. First operand 147 states and 200 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:23,184 INFO L93 Difference]: Finished difference Result 320 states and 432 transitions. [2024-10-13 06:33:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 06:33:23,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-10-13 06:33:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:23,186 INFO L225 Difference]: With dead ends: 320 [2024-10-13 06:33:23,186 INFO L226 Difference]: Without dead ends: 174 [2024-10-13 06:33:23,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:33:23,187 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 184 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:23,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 403 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 06:33:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-13 06:33:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 147. [2024-10-13 06:33:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 128 states have (on average 1.3125) internal successors, (168), 129 states have internal predecessors, (168), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:33:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2024-10-13 06:33:23,203 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 100 [2024-10-13 06:33:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:23,204 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2024-10-13 06:33:23,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2024-10-13 06:33:23,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 06:33:23,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:23,205 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:23,217 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 (9)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:23,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:23,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:23,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash 672651124, now seen corresponding path program 1 times [2024-10-13 06:33:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698475365] [2024-10-13 06:33:23,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:23,408 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-13 06:33:23,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:23,409 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-13 06:33:23,411 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-13 06:33:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:33:23,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:23,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:23,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:23,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698475365] [2024-10-13 06:33:23,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698475365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:23,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:23,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:23,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357217028] [2024-10-13 06:33:23,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:23,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:23,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:23,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:23,650 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:24,000 INFO L93 Difference]: Finished difference Result 273 states and 370 transitions. [2024-10-13 06:33:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:24,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-13 06:33:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:24,003 INFO L225 Difference]: With dead ends: 273 [2024-10-13 06:33:24,003 INFO L226 Difference]: Without dead ends: 127 [2024-10-13 06:33:24,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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-13 06:33:24,005 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:24,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:33:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-13 06:33:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-13 06:33:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 109 states have internal predecessors, (141), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:33:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 171 transitions. [2024-10-13 06:33:24,014 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 171 transitions. Word has length 100 [2024-10-13 06:33:24,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:24,015 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 171 transitions. [2024-10-13 06:33:24,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 171 transitions. [2024-10-13 06:33:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:33:24,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:24,016 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:24,026 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 (10)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:24,217 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-13 06:33:24,217 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:24,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash -986913442, now seen corresponding path program 1 times [2024-10-13 06:33:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:24,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468463716] [2024-10-13 06:33:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:24,218 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-13 06:33:24,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:24,220 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-13 06:33:24,221 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-13 06:33:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 06:33:24,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:24,487 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-13 06:33:24,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:24,545 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 33 treesize of output 35 [2024-10-13 06:33:24,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:24,598 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 49 [2024-10-13 06:33:24,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:24,660 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 69 treesize of output 74 [2024-10-13 06:33:24,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:24,717 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 75 treesize of output 29 [2024-10-13 06:33:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 06:33:24,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:24,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:24,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468463716] [2024-10-13 06:33:24,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468463716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:24,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:24,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:33:24,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434046668] [2024-10-13 06:33:24,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:24,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:33:24,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:24,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:33:24,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:33:24,751 INFO L87 Difference]: Start difference. First operand 127 states and 171 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:26,272 INFO L93 Difference]: Finished difference Result 266 states and 354 transitions. [2024-10-13 06:33:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 06:33:26,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-13 06:33:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:26,275 INFO L225 Difference]: With dead ends: 266 [2024-10-13 06:33:26,275 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 06:33:26,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:33:26,277 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 148 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:26,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 371 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 06:33:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 06:33:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 135. [2024-10-13 06:33:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.2831858407079646) internal successors, (145), 115 states have internal predecessors, (145), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:33:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 179 transitions. [2024-10-13 06:33:26,289 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 179 transitions. Word has length 101 [2024-10-13 06:33:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:26,289 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 179 transitions. [2024-10-13 06:33:26,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 179 transitions. [2024-10-13 06:33:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 06:33:26,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:26,291 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:26,302 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 (11)] Ended with exit code 0 [2024-10-13 06:33:26,491 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-13 06:33:26,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:26,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:26,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2079735285, now seen corresponding path program 1 times [2024-10-13 06:33:26,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:26,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614325950] [2024-10-13 06:33:26,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:26,493 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-13 06:33:26,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:26,494 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-13 06:33:26,495 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-13 06:33:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 06:33:26,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:26,749 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-13 06:33:26,804 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-13 06:33:28,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:28,458 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 41 treesize of output 47 [2024-10-13 06:33:34,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:34,009 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 60 treesize of output 53 [2024-10-13 06:33:34,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:34,119 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 55 treesize of output 63 [2024-10-13 06:33:34,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:34,438 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 72 treesize of output 77 [2024-10-13 06:33:34,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:34,593 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 92 [2024-10-13 06:33:34,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:34,716 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 103 treesize of output 117 [2024-10-13 06:33:35,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:35,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 138 treesize of output 62 [2024-10-13 06:33:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-13 06:33:35,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:35,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614325950] [2024-10-13 06:33:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614325950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:35,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:35,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:33:35,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864013687] [2024-10-13 06:33:35,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:35,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:33:35,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:35,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:33:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=87, Unknown=3, NotChecked=0, Total=132 [2024-10-13 06:33:35,111 INFO L87 Difference]: Start difference. First operand 135 states and 179 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-13 06:33:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:36,681 INFO L93 Difference]: Finished difference Result 271 states and 357 transitions. [2024-10-13 06:33:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:33:36,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 102 [2024-10-13 06:33:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:36,685 INFO L225 Difference]: With dead ends: 271 [2024-10-13 06:33:36,685 INFO L226 Difference]: Without dead ends: 141 [2024-10-13 06:33:36,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=72, Invalid=135, Unknown=3, NotChecked=0, Total=210 [2024-10-13 06:33:36,686 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 287 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:36,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 330 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 06:33:36,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-13 06:33:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-10-13 06:33:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 118 states have internal predecessors, (148), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:33:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2024-10-13 06:33:36,705 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 102 [2024-10-13 06:33:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:36,706 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2024-10-13 06:33:36,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-13 06:33:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2024-10-13 06:33:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:33:36,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:36,708 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:36,720 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 (12)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:36,908 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-13 06:33:36,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:36,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:36,909 INFO L85 PathProgramCache]: Analyzing trace with hash -137046205, now seen corresponding path program 1 times [2024-10-13 06:33:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:36,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139358470] [2024-10-13 06:33:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:36,909 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-13 06:33:36,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:36,910 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-13 06:33:36,911 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-13 06:33:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 06:33:37,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:37,200 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-13 06:33:37,248 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-13 06:33:37,325 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 35 [2024-10-13 06:33:39,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:39,010 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 62 treesize of output 41 [2024-10-13 06:33:39,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:39,119 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 51 treesize of output 41 [2024-10-13 06:33:39,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:39,228 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 51 treesize of output 41 [2024-10-13 06:33:39,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:39,521 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 66 treesize of output 68 [2024-10-13 06:33:39,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:39,632 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 83 treesize of output 91 [2024-10-13 06:33:39,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:39,753 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 102 treesize of output 116 [2024-10-13 06:33:40,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:40,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 108 treesize of output 44 [2024-10-13 06:33:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 134 proven. 18 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-13 06:33:40,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:33:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:40,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139358470] [2024-10-13 06:33:40,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139358470] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:33:40,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:33:40,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2024-10-13 06:33:40,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089249946] [2024-10-13 06:33:40,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:40,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:40,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=233, Unknown=1, NotChecked=0, Total=306 [2024-10-13 06:33:40,272 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:40,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:40,784 INFO L93 Difference]: Finished difference Result 343 states and 450 transitions. [2024-10-13 06:33:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:40,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-13 06:33:40,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:40,787 INFO L225 Difference]: With dead ends: 343 [2024-10-13 06:33:40,787 INFO L226 Difference]: Without dead ends: 210 [2024-10-13 06:33:40,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=77, Invalid=264, Unknown=1, NotChecked=0, Total=342 [2024-10-13 06:33:40,788 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 27 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:40,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 263 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:33:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-13 06:33:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 167. [2024-10-13 06:33:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 145 states have (on average 1.2620689655172415) internal successors, (183), 147 states have internal predecessors, (183), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:33:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 217 transitions. [2024-10-13 06:33:40,804 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 217 transitions. Word has length 103 [2024-10-13 06:33:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:40,805 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 217 transitions. [2024-10-13 06:33:40,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 217 transitions. [2024-10-13 06:33:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:33:40,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:40,806 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:33:40,817 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-13 06:33:41,010 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-13 06:33:41,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:41,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:41,011 INFO L85 PathProgramCache]: Analyzing trace with hash 564018373, now seen corresponding path program 1 times [2024-10-13 06:33:41,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:41,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754179433] [2024-10-13 06:33:41,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:41,012 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-13 06:33:41,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:41,013 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-13 06:33:41,014 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-13 06:33:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:41,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 06:33:41,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:41,307 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 35 treesize of output 28 [2024-10-13 06:33:41,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:41,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-10-13 06:33:41,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:41,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-10-13 06:33:41,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:41,660 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 46 treesize of output 37 [2024-10-13 06:33:43,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:43,556 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