./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-a_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.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 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:15:33,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:15:33,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:15:33,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:15:33,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:15:33,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:15:33,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:15:33,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:15:33,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:15:33,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:15:33,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:15:33,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:15:33,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:15:33,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:15:33,611 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:15:33,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:15:33,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:15:33,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:15:33,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:15:33,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:15:33,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:15:33,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:15:33,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:15:33,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:15:33,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:15:33,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:15:33,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:15:33,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:15:33,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:15:33,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:15:33,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:15:33,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:15:33,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:15:33,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:15:33,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:15:33,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:15:33,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:15:33,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:15:33,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:15:33,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:15:33,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:15:33,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:15:33,631 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 -> 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae [2024-10-24 11:15:33,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:15:33,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:15:33,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:15:33,921 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:15:33,921 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:15:33,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2024-10-24 11:15:35,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:15:35,671 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:15:35,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2024-10-24 11:15:35,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60aaabb1e/eec040406dee4780885e4fae6348347b/FLAGf9d2a8a64 [2024-10-24 11:15:36,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60aaabb1e/eec040406dee4780885e4fae6348347b [2024-10-24 11:15:36,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:15:36,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:15:36,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:15:36,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:15:36,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:15:36,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c8e320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36, skipping insertion in model container [2024-10-24 11:15:36,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:15:36,221 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-a_file-34.i[916,929] [2024-10-24 11:15:36,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:15:36,293 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:15:36,303 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-a_file-34.i[916,929] [2024-10-24 11:15:36,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:15:36,376 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:15:36,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36 WrapperNode [2024-10-24 11:15:36,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:15:36,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:15:36,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:15:36,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:15:36,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,450 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2024-10-24 11:15:36,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:15:36,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:15:36,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:15:36,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:15:36,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,502 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2024-10-24 11:15:36,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:15:36,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:15:36,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:15:36,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:15:36,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (1/1) ... [2024-10-24 11:15:36,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:15:36,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:15:36,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:15:36,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:15:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:15:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:15:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:15:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:15:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:15:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:15:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:15:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:15:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:15:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:15:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:15:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:15:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:15:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:15:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:15:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:15:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:15:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:15:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:15:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:15:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:15:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:15:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:15:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:15:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:15:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:15:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:15:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:15:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:15:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:15:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:15:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:15:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:15:36,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:15:36,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:15:36,811 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:15:36,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:15:37,344 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-24 11:15:37,344 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:15:37,400 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:15:37,401 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:15:37,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:15:37 BoogieIcfgContainer [2024-10-24 11:15:37,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:15:37,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:15:37,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:15:37,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:15:37,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:15:36" (1/3) ... [2024-10-24 11:15:37,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bea0431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:15:37, skipping insertion in model container [2024-10-24 11:15:37,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:36" (2/3) ... [2024-10-24 11:15:37,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bea0431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:15:37, skipping insertion in model container [2024-10-24 11:15:37,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:15:37" (3/3) ... [2024-10-24 11:15:37,411 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-34.i [2024-10-24 11:15:37,429 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:15:37,429 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:15:37,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:15:37,513 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;@158c9c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:15:37,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:15:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:15:37,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:37,536 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:37,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:37,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash 370900315, now seen corresponding path program 1 times [2024-10-24 11:15:37,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:37,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883755779] [2024-10-24 11:15:37,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:37,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:37,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:38,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:38,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883755779] [2024-10-24 11:15:38,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883755779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:38,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:38,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:15:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824902754] [2024-10-24 11:15:38,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:38,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:15:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:38,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:15:38,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:15:38,072 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:38,116 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2024-10-24 11:15:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:15:38,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2024-10-24 11:15:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:38,127 INFO L225 Difference]: With dead ends: 223 [2024-10-24 11:15:38,127 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 11:15:38,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:15:38,137 INFO L432 NwaCegarLoop]: 159 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, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:38,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 11:15:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-24 11:15:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-10-24 11:15:38,187 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2024-10-24 11:15:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:38,188 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-10-24 11:15:38,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-10-24 11:15:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:15:38,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:38,192 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:38,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:15:38,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:38,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1750368993, now seen corresponding path program 1 times [2024-10-24 11:15:38,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:38,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252397723] [2024-10-24 11:15:38,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:38,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:38,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:38,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252397723] [2024-10-24 11:15:38,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252397723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:38,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:38,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:15:38,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019266783] [2024-10-24 11:15:38,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:38,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:15:38,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:15:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:38,677 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:38,747 INFO L93 Difference]: Finished difference Result 223 states and 328 transitions. [2024-10-24 11:15:38,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:15:38,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2024-10-24 11:15:38,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:38,749 INFO L225 Difference]: With dead ends: 223 [2024-10-24 11:15:38,752 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 11:15:38,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:38,754 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:38,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 11:15:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 11:15:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-10-24 11:15:38,777 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 166 [2024-10-24 11:15:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:38,781 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-10-24 11:15:38,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-10-24 11:15:38,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:15:38,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:38,784 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:38,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:15:38,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:38,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:38,785 INFO L85 PathProgramCache]: Analyzing trace with hash 361074979, now seen corresponding path program 1 times [2024-10-24 11:15:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:38,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183781664] [2024-10-24 11:15:38,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:38,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:38,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183781664] [2024-10-24 11:15:38,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183781664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:38,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:38,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:15:38,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829451387] [2024-10-24 11:15:38,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:38,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:15:39,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:15:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:15:39,001 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:39,041 INFO L93 Difference]: Finished difference Result 226 states and 331 transitions. [2024-10-24 11:15:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:15:39,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2024-10-24 11:15:39,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:39,044 INFO L225 Difference]: With dead ends: 226 [2024-10-24 11:15:39,046 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 11:15:39,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:15:39,048 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:39,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 11:15:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-24 11:15:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2024-10-24 11:15:39,067 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 166 [2024-10-24 11:15:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:39,068 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2024-10-24 11:15:39,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2024-10-24 11:15:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:15:39,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:39,075 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:39,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:15:39,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:39,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1327868763, now seen corresponding path program 1 times [2024-10-24 11:15:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:39,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763344480] [2024-10-24 11:15:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:39,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:39,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763344480] [2024-10-24 11:15:39,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763344480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:39,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:15:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105697249] [2024-10-24 11:15:39,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:39,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:15:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:39,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:15:39,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:39,361 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:39,402 INFO L93 Difference]: Finished difference Result 229 states and 334 transitions. [2024-10-24 11:15:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:15:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2024-10-24 11:15:39,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:39,407 INFO L225 Difference]: With dead ends: 229 [2024-10-24 11:15:39,407 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:15:39,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:39,408 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:39,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:15:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-24 11:15:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-10-24 11:15:39,427 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 166 [2024-10-24 11:15:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:39,430 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-10-24 11:15:39,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-10-24 11:15:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 11:15:39,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:39,433 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:39,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:15:39,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:39,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash -508912813, now seen corresponding path program 1 times [2024-10-24 11:15:39,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:39,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634540416] [2024-10-24 11:15:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:39,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:39,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634540416] [2024-10-24 11:15:39,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634540416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:39,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:39,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:15:39,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810273261] [2024-10-24 11:15:39,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:39,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:15:39,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:39,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:15:39,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:15:39,624 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:39,670 INFO L93 Difference]: Finished difference Result 280 states and 406 transitions. [2024-10-24 11:15:39,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:15:39,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2024-10-24 11:15:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:39,674 INFO L225 Difference]: With dead ends: 280 [2024-10-24 11:15:39,675 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 11:15:39,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:15:39,676 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 56 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:39,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 309 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 11:15:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 135. [2024-10-24 11:15:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 110 states have internal predecessors, (150), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 196 transitions. [2024-10-24 11:15:39,694 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 196 transitions. Word has length 168 [2024-10-24 11:15:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:39,694 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 196 transitions. [2024-10-24 11:15:39,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2024-10-24 11:15:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 11:15:39,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:39,696 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:39,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:15:39,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:39,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1632496881, now seen corresponding path program 1 times [2024-10-24 11:15:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:39,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29173001] [2024-10-24 11:15:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:39,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:39,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29173001] [2024-10-24 11:15:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29173001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:39,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:39,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:15:39,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484045682] [2024-10-24 11:15:39,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:39,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:15:39,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:39,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:15:39,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:15:39,856 INFO L87 Difference]: Start difference. First operand 135 states and 196 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:39,886 INFO L93 Difference]: Finished difference Result 270 states and 393 transitions. [2024-10-24 11:15:39,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:15:39,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-10-24 11:15:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:39,891 INFO L225 Difference]: With dead ends: 270 [2024-10-24 11:15:39,891 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 11:15:39,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:15:39,895 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:39,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 11:15:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-24 11:15:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 197 transitions. [2024-10-24 11:15:39,911 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 197 transitions. Word has length 171 [2024-10-24 11:15:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:39,912 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 197 transitions. [2024-10-24 11:15:39,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 197 transitions. [2024-10-24 11:15:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 11:15:39,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:39,914 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:39,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:15:39,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:39,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1890662319, now seen corresponding path program 1 times [2024-10-24 11:15:39,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:39,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915905359] [2024-10-24 11:15:39,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:39,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:40,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:40,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915905359] [2024-10-24 11:15:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915905359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:40,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:40,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:15:40,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145903889] [2024-10-24 11:15:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:40,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:15:40,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:40,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:15:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:15:40,521 INFO L87 Difference]: Start difference. First operand 136 states and 197 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:40,740 INFO L93 Difference]: Finished difference Result 267 states and 387 transitions. [2024-10-24 11:15:40,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:15:40,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-10-24 11:15:40,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:40,742 INFO L225 Difference]: With dead ends: 267 [2024-10-24 11:15:40,742 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 11:15:40,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:15:40,744 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 201 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:40,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 269 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:15:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 11:15:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-10-24 11:15:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 187 transitions. [2024-10-24 11:15:40,768 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 187 transitions. Word has length 171 [2024-10-24 11:15:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:40,768 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 187 transitions. [2024-10-24 11:15:40,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 187 transitions. [2024-10-24 11:15:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-24 11:15:40,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:40,771 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:40,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:15:40,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:40,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash 754124037, now seen corresponding path program 1 times [2024-10-24 11:15:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:40,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167922026] [2024-10-24 11:15:40,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:40,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:41,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:41,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167922026] [2024-10-24 11:15:41,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167922026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:41,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:41,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:41,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312905306] [2024-10-24 11:15:41,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:41,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:41,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:41,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:41,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:41,356 INFO L87 Difference]: Start difference. First operand 130 states and 187 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:41,610 INFO L93 Difference]: Finished difference Result 257 states and 370 transitions. [2024-10-24 11:15:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:15:41,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 173 [2024-10-24 11:15:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:41,615 INFO L225 Difference]: With dead ends: 257 [2024-10-24 11:15:41,615 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 11:15:41,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:15:41,616 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 179 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:41,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 343 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:15:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 11:15:41,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-10-24 11:15:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 102 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2024-10-24 11:15:41,630 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 173 [2024-10-24 11:15:41,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:41,631 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2024-10-24 11:15:41,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2024-10-24 11:15:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-24 11:15:41,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:41,633 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:41,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:15:41,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:41,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:41,634 INFO L85 PathProgramCache]: Analyzing trace with hash -464214425, now seen corresponding path program 1 times [2024-10-24 11:15:41,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:41,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671162404] [2024-10-24 11:15:41,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:41,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:41,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671162404] [2024-10-24 11:15:41,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671162404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:41,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:41,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:15:41,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294581597] [2024-10-24 11:15:41,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:41,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:15:41,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:41,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:15:41,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:15:41,802 INFO L87 Difference]: Start difference. First operand 127 states and 182 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:41,835 INFO L93 Difference]: Finished difference Result 278 states and 397 transitions. [2024-10-24 11:15:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:15:41,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-10-24 11:15:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:41,836 INFO L225 Difference]: With dead ends: 278 [2024-10-24 11:15:41,836 INFO L226 Difference]: Without dead ends: 152 [2024-10-24 11:15:41,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:15:41,837 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 50 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:41,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 337 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-24 11:15:41,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2024-10-24 11:15:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 179 transitions. [2024-10-24 11:15:41,850 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 179 transitions. Word has length 173 [2024-10-24 11:15:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:41,851 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 179 transitions. [2024-10-24 11:15:41,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 179 transitions. [2024-10-24 11:15:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:41,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:41,853 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:41,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:15:41,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:41,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:41,854 INFO L85 PathProgramCache]: Analyzing trace with hash 884410523, now seen corresponding path program 1 times [2024-10-24 11:15:41,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:41,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680913141] [2024-10-24 11:15:41,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:41,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:42,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:42,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680913141] [2024-10-24 11:15:42,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680913141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:42,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:42,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:15:42,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634772301] [2024-10-24 11:15:42,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:42,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:15:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:42,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:15:42,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:15:42,870 INFO L87 Difference]: Start difference. First operand 127 states and 179 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:43,153 INFO L93 Difference]: Finished difference Result 387 states and 544 transitions. [2024-10-24 11:15:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:15:43,154 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:15:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:43,156 INFO L225 Difference]: With dead ends: 387 [2024-10-24 11:15:43,156 INFO L226 Difference]: Without dead ends: 261 [2024-10-24 11:15:43,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:15:43,157 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 145 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:43,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1905 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:15:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-24 11:15:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 160. [2024-10-24 11:15:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.3111111111111111) internal successors, (177), 135 states have internal predecessors, (177), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 223 transitions. [2024-10-24 11:15:43,170 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 223 transitions. Word has length 175 [2024-10-24 11:15:43,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:43,170 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 223 transitions. [2024-10-24 11:15:43,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 223 transitions. [2024-10-24 11:15:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:43,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:43,172 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:43,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:15:43,173 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:43,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash 491383513, now seen corresponding path program 1 times [2024-10-24 11:15:43,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:43,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756221879] [2024-10-24 11:15:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:43,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:43,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:43,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756221879] [2024-10-24 11:15:43,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756221879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:43,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:43,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:15:43,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909964609] [2024-10-24 11:15:43,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:43,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:15:43,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:43,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:15:43,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:43,355 INFO L87 Difference]: Start difference. First operand 160 states and 223 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:43,393 INFO L93 Difference]: Finished difference Result 324 states and 452 transitions. [2024-10-24 11:15:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:15:43,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:15:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:43,396 INFO L225 Difference]: With dead ends: 324 [2024-10-24 11:15:43,396 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 11:15:43,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:43,397 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:43,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 432 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 11:15:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2024-10-24 11:15:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 139 states have (on average 1.3021582733812949) internal successors, (181), 139 states have internal predecessors, (181), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2024-10-24 11:15:43,411 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 175 [2024-10-24 11:15:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:43,412 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2024-10-24 11:15:43,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2024-10-24 11:15:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:43,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:43,415 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:43,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:15:43,415 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:43,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash 749548951, now seen corresponding path program 1 times [2024-10-24 11:15:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383746032] [2024-10-24 11:15:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:43,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:43,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383746032] [2024-10-24 11:15:43,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383746032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:43,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:43,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842616560] [2024-10-24 11:15:43,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:43,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:43,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:43,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:43,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:43,882 INFO L87 Difference]: Start difference. First operand 164 states and 227 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:44,000 INFO L93 Difference]: Finished difference Result 380 states and 521 transitions. [2024-10-24 11:15:44,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:15:44,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:15:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:44,002 INFO L225 Difference]: With dead ends: 380 [2024-10-24 11:15:44,003 INFO L226 Difference]: Without dead ends: 217 [2024-10-24 11:15:44,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:15:44,004 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 49 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:44,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 688 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-24 11:15:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209. [2024-10-24 11:15:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 177 states have (on average 1.2881355932203389) internal successors, (228), 178 states have internal predecessors, (228), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:15:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 286 transitions. [2024-10-24 11:15:44,020 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 286 transitions. Word has length 175 [2024-10-24 11:15:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:44,022 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 286 transitions. [2024-10-24 11:15:44,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:44,023 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 286 transitions. [2024-10-24 11:15:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:44,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:44,025 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:44,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:15:44,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:44,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:44,026 INFO L85 PathProgramCache]: Analyzing trace with hash -261568299, now seen corresponding path program 1 times [2024-10-24 11:15:44,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:44,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698637623] [2024-10-24 11:15:44,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:44,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:44,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698637623] [2024-10-24 11:15:44,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698637623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:44,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:44,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:44,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782030526] [2024-10-24 11:15:44,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:44,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:44,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:44,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:44,704 INFO L87 Difference]: Start difference. First operand 209 states and 286 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:44,866 INFO L93 Difference]: Finished difference Result 570 states and 773 transitions. [2024-10-24 11:15:44,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:15:44,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2024-10-24 11:15:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:44,870 INFO L225 Difference]: With dead ends: 570 [2024-10-24 11:15:44,870 INFO L226 Difference]: Without dead ends: 362 [2024-10-24 11:15:44,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:15:44,872 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 115 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:44,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 498 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-24 11:15:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 357. [2024-10-24 11:15:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 309 states have (on average 1.2750809061488673) internal successors, (394), 312 states have internal predecessors, (394), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 11:15:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 480 transitions. [2024-10-24 11:15:44,897 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 480 transitions. Word has length 175 [2024-10-24 11:15:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:44,898 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 480 transitions. [2024-10-24 11:15:44,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 480 transitions. [2024-10-24 11:15:44,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:44,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:44,901 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:44,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:15:44,901 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:44,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash 750397017, now seen corresponding path program 1 times [2024-10-24 11:15:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:44,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094778885] [2024-10-24 11:15:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:44,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:45,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:45,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094778885] [2024-10-24 11:15:45,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094778885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:45,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:45,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:15:45,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815836532] [2024-10-24 11:15:45,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:45,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:15:45,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:45,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:15:45,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:45,047 INFO L87 Difference]: Start difference. First operand 357 states and 480 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:45,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:45,088 INFO L93 Difference]: Finished difference Result 674 states and 910 transitions. [2024-10-24 11:15:45,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:15:45,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:15:45,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:45,092 INFO L225 Difference]: With dead ends: 674 [2024-10-24 11:15:45,092 INFO L226 Difference]: Without dead ends: 318 [2024-10-24 11:15:45,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:45,094 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:45,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 432 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-24 11:15:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-10-24 11:15:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 270 states have (on average 1.2703703703703704) internal successors, (343), 273 states have internal predecessors, (343), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 11:15:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 429 transitions. [2024-10-24 11:15:45,118 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 429 transitions. Word has length 175 [2024-10-24 11:15:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:45,118 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 429 transitions. [2024-10-24 11:15:45,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 429 transitions. [2024-10-24 11:15:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:45,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:45,120 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:45,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:15:45,121 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:45,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash -199528685, now seen corresponding path program 1 times [2024-10-24 11:15:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:45,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132945586] [2024-10-24 11:15:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:45,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:45,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:45,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132945586] [2024-10-24 11:15:45,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132945586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:45,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:45,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:45,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185009400] [2024-10-24 11:15:45,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:45,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:45,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:45,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:45,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:45,933 INFO L87 Difference]: Start difference. First operand 318 states and 429 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:46,095 INFO L93 Difference]: Finished difference Result 870 states and 1171 transitions. [2024-10-24 11:15:46,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:15:46,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2024-10-24 11:15:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:46,098 INFO L225 Difference]: With dead ends: 870 [2024-10-24 11:15:46,098 INFO L226 Difference]: Without dead ends: 553 [2024-10-24 11:15:46,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:15:46,099 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 115 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:46,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 502 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-10-24 11:15:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 407. [2024-10-24 11:15:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 359 states have (on average 1.2841225626740946) internal successors, (461), 362 states have internal predecessors, (461), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 11:15:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 547 transitions. [2024-10-24 11:15:46,124 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 547 transitions. Word has length 175 [2024-10-24 11:15:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:46,125 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 547 transitions. [2024-10-24 11:15:46,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 547 transitions. [2024-10-24 11:15:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:46,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:46,127 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:46,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:15:46,127 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:46,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash 812436631, now seen corresponding path program 1 times [2024-10-24 11:15:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:46,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827023512] [2024-10-24 11:15:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:46,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:46,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827023512] [2024-10-24 11:15:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827023512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:46,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:46,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:46,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020606787] [2024-10-24 11:15:46,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:46,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:46,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:46,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:46,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:46,504 INFO L87 Difference]: Start difference. First operand 407 states and 547 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:46,661 INFO L93 Difference]: Finished difference Result 868 states and 1163 transitions. [2024-10-24 11:15:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:15:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:15:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:46,664 INFO L225 Difference]: With dead ends: 868 [2024-10-24 11:15:46,664 INFO L226 Difference]: Without dead ends: 462 [2024-10-24 11:15:46,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:15:46,666 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 134 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:46,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 554 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:46,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-24 11:15:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 382. [2024-10-24 11:15:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 334 states have (on average 1.2754491017964071) internal successors, (426), 337 states have internal predecessors, (426), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 11:15:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 512 transitions. [2024-10-24 11:15:46,693 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 512 transitions. Word has length 175 [2024-10-24 11:15:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:46,694 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 512 transitions. [2024-10-24 11:15:46,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 512 transitions. [2024-10-24 11:15:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:46,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:46,696 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:46,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:15:46,697 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:46,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash -709001775, now seen corresponding path program 1 times [2024-10-24 11:15:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:46,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642589786] [2024-10-24 11:15:46,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:46,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:47,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:47,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642589786] [2024-10-24 11:15:47,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642589786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:47,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:47,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:47,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020478704] [2024-10-24 11:15:47,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:47,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:47,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:47,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:47,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:47,046 INFO L87 Difference]: Start difference. First operand 382 states and 512 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:47,214 INFO L93 Difference]: Finished difference Result 808 states and 1077 transitions. [2024-10-24 11:15:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:15:47,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:15:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:47,218 INFO L225 Difference]: With dead ends: 808 [2024-10-24 11:15:47,218 INFO L226 Difference]: Without dead ends: 427 [2024-10-24 11:15:47,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:15:47,219 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 139 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:47,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 703 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-24 11:15:47,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 281. [2024-10-24 11:15:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 245 states have (on average 1.2653061224489797) internal successors, (310), 246 states have internal predecessors, (310), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 11:15:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 372 transitions. [2024-10-24 11:15:47,240 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 372 transitions. Word has length 175 [2024-10-24 11:15:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:47,240 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 372 transitions. [2024-10-24 11:15:47,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 372 transitions. [2024-10-24 11:15:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:47,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:47,242 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:47,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:15:47,243 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:47,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:47,259 INFO L85 PathProgramCache]: Analyzing trace with hash 302963541, now seen corresponding path program 1 times [2024-10-24 11:15:47,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:47,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401310199] [2024-10-24 11:15:47,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:47,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:47,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:47,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401310199] [2024-10-24 11:15:47,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401310199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:47,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:47,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845266794] [2024-10-24 11:15:47,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:47,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:47,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:47,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:47,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:47,953 INFO L87 Difference]: Start difference. First operand 281 states and 372 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:48,124 INFO L93 Difference]: Finished difference Result 633 states and 837 transitions. [2024-10-24 11:15:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:15:48,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2024-10-24 11:15:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:48,127 INFO L225 Difference]: With dead ends: 633 [2024-10-24 11:15:48,127 INFO L226 Difference]: Without dead ends: 353 [2024-10-24 11:15:48,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:15:48,128 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 117 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:48,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 674 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-24 11:15:48,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 279. [2024-10-24 11:15:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 243 states have (on average 1.2551440329218106) internal successors, (305), 244 states have internal predecessors, (305), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 11:15:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 367 transitions. [2024-10-24 11:15:48,147 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 367 transitions. Word has length 175 [2024-10-24 11:15:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:48,148 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 367 transitions. [2024-10-24 11:15:48,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 367 transitions. [2024-10-24 11:15:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:48,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:48,150 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:48,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:15:48,150 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:48,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:48,151 INFO L85 PathProgramCache]: Analyzing trace with hash -708153709, now seen corresponding path program 1 times [2024-10-24 11:15:48,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:48,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338456600] [2024-10-24 11:15:48,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:48,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:48,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338456600] [2024-10-24 11:15:48,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338456600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:48,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:48,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288362375] [2024-10-24 11:15:48,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:48,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:48,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:48,810 INFO L87 Difference]: Start difference. First operand 279 states and 367 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:48,985 INFO L93 Difference]: Finished difference Result 562 states and 736 transitions. [2024-10-24 11:15:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:15:48,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2024-10-24 11:15:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:48,989 INFO L225 Difference]: With dead ends: 562 [2024-10-24 11:15:48,989 INFO L226 Difference]: Without dead ends: 284 [2024-10-24 11:15:48,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:15:48,990 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 117 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:48,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 684 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-24 11:15:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 236. [2024-10-24 11:15:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 209 states have (on average 1.2535885167464116) internal successors, (262), 209 states have internal predecessors, (262), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 308 transitions. [2024-10-24 11:15:49,009 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 308 transitions. Word has length 175 [2024-10-24 11:15:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:49,009 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 308 transitions. [2024-10-24 11:15:49,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:15:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 308 transitions. [2024-10-24 11:15:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:49,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:49,011 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:49,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:15:49,012 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:49,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:49,012 INFO L85 PathProgramCache]: Analyzing trace with hash -449988271, now seen corresponding path program 1 times [2024-10-24 11:15:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:49,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064892145] [2024-10-24 11:15:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:49,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:49,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064892145] [2024-10-24 11:15:49,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064892145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:49,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077138457] [2024-10-24 11:15:49,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:49,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:49,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:49,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:49,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:49,386 INFO L87 Difference]: Start difference. First operand 236 states and 308 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:49,514 INFO L93 Difference]: Finished difference Result 513 states and 668 transitions. [2024-10-24 11:15:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:15:49,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:15:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:49,516 INFO L225 Difference]: With dead ends: 513 [2024-10-24 11:15:49,516 INFO L226 Difference]: Without dead ends: 278 [2024-10-24 11:15:49,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:15:49,518 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 49 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:49,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 772 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-24 11:15:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 236. [2024-10-24 11:15:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 209 states have (on average 1.2488038277511961) internal successors, (261), 209 states have internal predecessors, (261), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:15:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 307 transitions. [2024-10-24 11:15:49,535 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 307 transitions. Word has length 175 [2024-10-24 11:15:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:49,536 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 307 transitions. [2024-10-24 11:15:49,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 307 transitions. [2024-10-24 11:15:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:49,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:49,538 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:49,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:15:49,538 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash -843015281, now seen corresponding path program 1 times [2024-10-24 11:15:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478933860] [2024-10-24 11:15:49,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:51,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:51,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478933860] [2024-10-24 11:15:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478933860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:51,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:51,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:15:51,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689854051] [2024-10-24 11:15:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:51,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:15:51,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:51,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:15:51,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:15:51,214 INFO L87 Difference]: Start difference. First operand 236 states and 307 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-10-24 11:15:51,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:51,695 INFO L93 Difference]: Finished difference Result 503 states and 655 transitions. [2024-10-24 11:15:51,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:15:51,696 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 175 [2024-10-24 11:15:51,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:51,699 INFO L225 Difference]: With dead ends: 503 [2024-10-24 11:15:51,699 INFO L226 Difference]: Without dead ends: 268 [2024-10-24 11:15:51,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:15:51,700 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 56 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:51,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1754 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:15:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-24 11:15:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2024-10-24 11:15:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 233 states have (on average 1.2532188841201717) internal successors, (292), 234 states have internal predecessors, (292), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:15:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 346 transitions. [2024-10-24 11:15:51,730 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 346 transitions. Word has length 175 [2024-10-24 11:15:51,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:51,730 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 346 transitions. [2024-10-24 11:15:51,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2024-10-24 11:15:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 346 transitions. [2024-10-24 11:15:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:15:51,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:51,736 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:51,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 11:15:51,737 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:51,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:51,737 INFO L85 PathProgramCache]: Analyzing trace with hash -788525182, now seen corresponding path program 1 times [2024-10-24 11:15:51,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:51,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417106047] [2024-10-24 11:15:51,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:51,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:52,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:52,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417106047] [2024-10-24 11:15:52,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417106047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:52,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:52,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:15:52,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936383810] [2024-10-24 11:15:52,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:52,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:15:52,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:52,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:15:52,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:15:52,027 INFO L87 Difference]: Start difference. First operand 265 states and 346 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:52,259 INFO L93 Difference]: Finished difference Result 704 states and 917 transitions. [2024-10-24 11:15:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:15:52,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:15:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:52,263 INFO L225 Difference]: With dead ends: 704 [2024-10-24 11:15:52,263 INFO L226 Difference]: Without dead ends: 440 [2024-10-24 11:15:52,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:15:52,267 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 109 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:52,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 406 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:15:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-24 11:15:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 332. [2024-10-24 11:15:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 274 states have (on average 1.2262773722627738) internal successors, (336), 275 states have internal predecessors, (336), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:15:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 436 transitions. [2024-10-24 11:15:52,310 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 436 transitions. Word has length 175 [2024-10-24 11:15:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:52,310 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 436 transitions. [2024-10-24 11:15:52,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 436 transitions. [2024-10-24 11:15:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 11:15:52,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:52,312 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:52,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 11:15:52,313 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash 816954960, now seen corresponding path program 1 times [2024-10-24 11:15:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248737866] [2024-10-24 11:15:52,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:52,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:52,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248737866] [2024-10-24 11:15:52,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248737866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:52,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:52,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:15:52,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423692731] [2024-10-24 11:15:52,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:52,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:15:52,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:52,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:15:52,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:15:52,506 INFO L87 Difference]: Start difference. First operand 332 states and 436 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:52,580 INFO L93 Difference]: Finished difference Result 602 states and 789 transitions. [2024-10-24 11:15:52,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:15:52,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2024-10-24 11:15:52,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:52,583 INFO L225 Difference]: With dead ends: 602 [2024-10-24 11:15:52,583 INFO L226 Difference]: Without dead ends: 338 [2024-10-24 11:15:52,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:15:52,585 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:52,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 574 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:15:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-24 11:15:52,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-10-24 11:15:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 280 states have (on average 1.2214285714285715) internal successors, (342), 281 states have internal predecessors, (342), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:15:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2024-10-24 11:15:52,620 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 177 [2024-10-24 11:15:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:52,621 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2024-10-24 11:15:52,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2024-10-24 11:15:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 11:15:52,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:52,623 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:52,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 11:15:52,623 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:52,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1212426507, now seen corresponding path program 1 times [2024-10-24 11:15:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:52,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494513573] [2024-10-24 11:15:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:52,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:15:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:15:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:15:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:15:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:15:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:15:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:15:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:15:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:15:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:52,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:15:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:15:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:15:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:15:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:15:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:15:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:15:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:15:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:15:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:15:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:15:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:15:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:15:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-24 11:15:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:15:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:15:53,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:15:53,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494513573] [2024-10-24 11:15:53,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494513573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:15:53,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:15:53,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:15:53,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161005417] [2024-10-24 11:15:53,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:15:53,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:15:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:15:53,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:15:53,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:15:53,019 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:15:53,196 INFO L93 Difference]: Finished difference Result 596 states and 772 transitions. [2024-10-24 11:15:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:15:53,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2024-10-24 11:15:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:15:53,199 INFO L225 Difference]: With dead ends: 596 [2024-10-24 11:15:53,200 INFO L226 Difference]: Without dead ends: 594 [2024-10-24 11:15:53,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 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-24 11:15:53,201 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 88 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:15:53,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 878 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:15:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-10-24 11:15:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 591. [2024-10-24 11:15:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 510 states have (on average 1.2294117647058824) internal successors, (627), 513 states have internal predecessors, (627), 69 states have call successors, (69), 11 states have call predecessors, (69), 11 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-24 11:15:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 765 transitions. [2024-10-24 11:15:53,250 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 765 transitions. Word has length 179 [2024-10-24 11:15:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:15:53,250 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 765 transitions. [2024-10-24 11:15:53,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:15:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 765 transitions. [2024-10-24 11:15:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 11:15:53,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:15:53,252 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:15:53,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 11:15:53,253 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:15:53,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:15:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash 838557491, now seen corresponding path program 1 times [2024-10-24 11:15:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:15:53,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572949271] [2024-10-24 11:15:53,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:15:53,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:15:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:15:53,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:15:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:15:53,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:15:53,472 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:15:53,474 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:15:53,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 11:15:53,480 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, 1, 1, 1] [2024-10-24 11:15:53,580 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:15:53,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:15:53 BoogieIcfgContainer [2024-10-24 11:15:53,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:15:53,584 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:15:53,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:15:53,584 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:15:53,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:15:37" (3/4) ... [2024-10-24 11:15:53,586 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:15:53,587 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:15:53,587 INFO L158 Benchmark]: Toolchain (without parser) took 17554.10ms. Allocated memory was 153.1MB in the beginning and 578.8MB in the end (delta: 425.7MB). Free memory was 97.4MB in the beginning and 319.5MB in the end (delta: -222.1MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. [2024-10-24 11:15:53,588 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:15:53,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.64ms. Allocated memory is still 153.1MB. Free memory was 97.4MB in the beginning and 81.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:15:53,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.65ms. Allocated memory is still 153.1MB. Free memory was 81.2MB in the beginning and 77.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:15:53,589 INFO L158 Benchmark]: Boogie Preprocessor took 100.33ms. Allocated memory is still 153.1MB. Free memory was 77.0MB in the beginning and 72.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:15:53,589 INFO L158 Benchmark]: RCFGBuilder took 848.47ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 72.8MB in the beginning and 194.5MB in the end (delta: -121.7MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-10-24 11:15:53,589 INFO L158 Benchmark]: TraceAbstraction took 16179.59ms. Allocated memory was 230.7MB in the beginning and 578.8MB in the end (delta: 348.1MB). Free memory was 194.5MB in the beginning and 319.5MB in the end (delta: -124.9MB). Peak memory consumption was 224.2MB. Max. memory is 16.1GB. [2024-10-24 11:15:53,589 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 578.8MB. Free memory is still 319.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:15:53,591 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.64ms. Allocated memory is still 153.1MB. Free memory was 97.4MB in the beginning and 81.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.65ms. Allocated memory is still 153.1MB. Free memory was 81.2MB in the beginning and 77.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.33ms. Allocated memory is still 153.1MB. Free memory was 77.0MB in the beginning and 72.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 848.47ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 72.8MB in the beginning and 194.5MB in the end (delta: -121.7MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16179.59ms. Allocated memory was 230.7MB in the beginning and 578.8MB in the end (delta: 348.1MB). Free memory was 194.5MB in the beginning and 319.5MB in the end (delta: -124.9MB). Peak memory consumption was 224.2MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 578.8MB. Free memory is still 319.5MB. 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 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L34] unsigned char last_1_BOOL_unsigned_char_Array_0_1__1_ = 0; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L99] EXPR BOOL_unsigned_char_Array_0[1][1] [L99] last_1_BOOL_unsigned_char_Array_0_1__1_ = BOOL_unsigned_char_Array_0[1][1] [L109] RET updateLastVariables() [L110] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] double_Array_0[0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] signed_char_Array_0[4] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L92] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L94] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L110] RET updateVariables() [L111] CALL step() [L38] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L43] EXPR double_Array_0[1] [L43] EXPR double_Array_0[0] [L43] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L43] COND FALSE !(double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) [L46] EXPR BOOL_unsigned_char_Array_0[0][2] [L46] BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L46] BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L46] COND TRUE BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) [L47] EXPR BOOL_unsigned_char_Array_0[1][2] [L47] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] BOOL_unsigned_char_Array_0[1][1] = ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]) [L51] EXPR unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[0] [L51] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L51] EXPR ((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR ((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L51] signed long int stepLocal_1 = (unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1))); [L52] EXPR signed_char_Array_0[2] [L52] signed char stepLocal_0 = signed_char_Array_0[2]; [L53] COND FALSE !(-10 >= stepLocal_0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1 [L102] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) [L102] EXPR BOOL_unsigned_char_Array_0[0][2] [L102] EXPR BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))) [L102] EXPR BOOL_unsigned_char_Array_0[1][1] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) [L102] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1 [L102] EXPR (-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) [L102] EXPR double_Array_0[1] [L102] EXPR double_Array_0[0] [L102] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1 [L102] EXPR signed_char_Array_0[2] [L102] EXPR signed_char_Array_0[4] [L102] EXPR (double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102-L103] return (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 25, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1727 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1721 mSDsluCounter, 14423 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10504 mSDsCounter, 435 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2035 IncrementalHoareTripleChecker+Invalid, 2470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 435 mSolverCounterUnsat, 3919 mSDtfsCounter, 2035 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1308 GetRequests, 1199 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=24, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 823 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 4330 NumberOfCodeBlocks, 4330 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4127 ConstructedInterpolants, 0 QuantifiedInterpolants, 6806 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 24288/24288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:15:53,628 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-a_file-34.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 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:15:56,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:15:56,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:15:56,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:15:56,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:15:56,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:15:56,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:15:56,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:15:56,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:15:56,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:15:56,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:15:56,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:15:56,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:15:56,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:15:56,127 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:15:56,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:15:56,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:15:56,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:15:56,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:15:56,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:15:56,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:15:56,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:15:56,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:15:56,134 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:15:56,136 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:15:56,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:15:56,136 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:15:56,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:15:56,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:15:56,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:15:56,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:15:56,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:15:56,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:15:56,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:15:56,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:15:56,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:15:56,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:15:56,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:15:56,140 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:15:56,140 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:15:56,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:15:56,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:15:56,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:15:56,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:15:56,142 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:15:56,142 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 -> 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae [2024-10-24 11:15:56,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:15:56,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:15:56,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:15:56,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:15:56,530 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:15:56,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2024-10-24 11:15:58,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:15:58,289 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:15:58,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2024-10-24 11:15:58,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c311a9d6/b95d31b35d444946bcdee11c90e5d921/FLAG0a8c8f64d [2024-10-24 11:15:58,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c311a9d6/b95d31b35d444946bcdee11c90e5d921 [2024-10-24 11:15:58,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:15:58,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:15:58,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:15:58,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:15:58,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:15:58,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:15:58" (1/1) ... [2024-10-24 11:15:58,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4677060b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:58, skipping insertion in model container [2024-10-24 11:15:58,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:15:58" (1/1) ... [2024-10-24 11:15:58,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:15:58,897 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-a_file-34.i[916,929] [2024-10-24 11:15:58,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:15:58,990 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:15:59,002 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-a_file-34.i[916,929] [2024-10-24 11:15:59,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:15:59,096 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:15:59,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59 WrapperNode [2024-10-24 11:15:59,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:15:59,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:15:59,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:15:59,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:15:59,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,174 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2024-10-24 11:15:59,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:15:59,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:15:59,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:15:59,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:15:59,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,233 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2024-10-24 11:15:59,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:15:59,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:15:59,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:15:59,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:15:59,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (1/1) ... [2024-10-24 11:15:59,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:15:59,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:15:59,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:15:59,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:15:59,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:15:59,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:15:59,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:15:59,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-24 11:15:59,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-24 11:15:59,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-24 11:15:59,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:15:59,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:15:59,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-24 11:15:59,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-24 11:15:59,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-24 11:15:59,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:15:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:15:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:15:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:15:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:15:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:15:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:15:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:15:59,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:15:59,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:15:59,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:15:59,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:15:59,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-24 11:15:59,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-24 11:15:59,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-24 11:15:59,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:15:59,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:15:59,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:15:59,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:15:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:15:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:15:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:15:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:15:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:15:59,525 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:15:59,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:16:05,961 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-10-24 11:16:05,963 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:16:06,026 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:16:06,027 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:16:06,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:16:06 BoogieIcfgContainer [2024-10-24 11:16:06,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:16:06,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:16:06,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:16:06,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:16:06,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:15:58" (1/3) ... [2024-10-24 11:16:06,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240cc96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:16:06, skipping insertion in model container [2024-10-24 11:16:06,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:15:59" (2/3) ... [2024-10-24 11:16:06,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240cc96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:16:06, skipping insertion in model container [2024-10-24 11:16:06,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:16:06" (3/3) ... [2024-10-24 11:16:06,036 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-34.i [2024-10-24 11:16:06,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:16:06,049 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:16:06,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:16:06,108 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;@e73423f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:16:06,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:16:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:16:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:16:06,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:06,130 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:06,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:06,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash 370900315, now seen corresponding path program 1 times [2024-10-24 11:16:06,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:06,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585657929] [2024-10-24 11:16:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:06,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:06,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:06,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:06,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:16:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:06,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:16:06,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2024-10-24 11:16:06,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:06,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:06,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585657929] [2024-10-24 11:16:06,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585657929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:06,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:06,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:16:06,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188207376] [2024-10-24 11:16:06,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:06,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:16:06,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:06,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:16:06,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:16:06,665 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:16:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:06,738 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2024-10-24 11:16:06,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:16:06,740 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2024-10-24 11:16:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:06,747 INFO L225 Difference]: With dead ends: 223 [2024-10-24 11:16:06,747 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 11:16:06,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:16:06,753 INFO L432 NwaCegarLoop]: 159 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, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:06,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:16:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 11:16:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-24 11:16:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:16:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-10-24 11:16:06,807 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2024-10-24 11:16:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:06,808 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-10-24 11:16:06,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:16:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-10-24 11:16:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:16:06,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:06,812 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:06,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:16:07,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:07,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:07,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1750368993, now seen corresponding path program 1 times [2024-10-24 11:16:07,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:07,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191749082] [2024-10-24 11:16:07,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:07,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:07,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:07,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:07,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:16:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:07,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:16:07,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-10-24 11:16:07,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:07,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:07,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191749082] [2024-10-24 11:16:07,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191749082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:07,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:07,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:16:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864348563] [2024-10-24 11:16:07,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:07,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:16:07,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:07,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:16:07,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:16:07,503 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:16:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:07,634 INFO L93 Difference]: Finished difference Result 223 states and 328 transitions. [2024-10-24 11:16:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:16:07,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2024-10-24 11:16:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:07,638 INFO L225 Difference]: With dead ends: 223 [2024-10-24 11:16:07,638 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 11:16:07,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:16:07,640 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:07,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:16:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 11:16:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 11:16:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:16:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-10-24 11:16:07,658 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 166 [2024-10-24 11:16:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:07,659 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-10-24 11:16:07,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 11:16:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-10-24 11:16:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 11:16:07,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:07,662 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:07,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:07,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:07,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:07,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:07,868 INFO L85 PathProgramCache]: Analyzing trace with hash 361074979, now seen corresponding path program 1 times [2024-10-24 11:16:07,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:07,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29595772] [2024-10-24 11:16:07,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:07,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:07,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:07,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:07,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:16:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:08,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:16:08,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:08,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:08,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:08,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29595772] [2024-10-24 11:16:08,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29595772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:08,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:08,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:16:08,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903178399] [2024-10-24 11:16:08,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:08,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:16:08,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:08,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:16:08,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:16:08,315 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:08,383 INFO L93 Difference]: Finished difference Result 223 states and 326 transitions. [2024-10-24 11:16:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:16:08,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2024-10-24 11:16:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:08,388 INFO L225 Difference]: With dead ends: 223 [2024-10-24 11:16:08,388 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 11:16:08,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:16:08,393 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:08,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:16:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 11:16:08,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-24 11:16:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:16:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-10-24 11:16:08,411 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 166 [2024-10-24 11:16:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:08,412 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-10-24 11:16:08,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-10-24 11:16:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 11:16:08,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:08,418 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:08,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:08,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:08,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:08,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1438058895, now seen corresponding path program 1 times [2024-10-24 11:16:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:08,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464365464] [2024-10-24 11:16:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:08,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:08,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:08,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:08,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:16:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:08,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:16:08,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:09,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:09,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:09,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464365464] [2024-10-24 11:16:09,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464365464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:09,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:09,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:16:09,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670945427] [2024-10-24 11:16:09,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:09,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:16:09,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:09,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:16:09,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:16:09,036 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:09,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:09,113 INFO L93 Difference]: Finished difference Result 223 states and 324 transitions. [2024-10-24 11:16:09,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:16:09,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2024-10-24 11:16:09,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:09,116 INFO L225 Difference]: With dead ends: 223 [2024-10-24 11:16:09,116 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 11:16:09,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:16:09,118 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:09,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:16:09,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 11:16:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 11:16:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:16:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-10-24 11:16:09,126 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 168 [2024-10-24 11:16:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:09,127 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-10-24 11:16:09,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-10-24 11:16:09,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 11:16:09,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:09,129 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:09,142 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-24 11:16:09,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:09,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:09,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1037189699, now seen corresponding path program 1 times [2024-10-24 11:16:09,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:09,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470216985] [2024-10-24 11:16:09,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:09,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:09,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:09,334 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:09,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:16:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:09,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:16:09,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:09,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:16:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:10,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:10,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470216985] [2024-10-24 11:16:10,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470216985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:10,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:10,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:16:10,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135518936] [2024-10-24 11:16:10,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:10,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:16:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:16:10,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:16:10,804 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:11,142 INFO L93 Difference]: Finished difference Result 339 states and 489 transitions. [2024-10-24 11:16:11,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:16:11,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 170 [2024-10-24 11:16:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:11,145 INFO L225 Difference]: With dead ends: 339 [2024-10-24 11:16:11,145 INFO L226 Difference]: Without dead ends: 227 [2024-10-24 11:16:11,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:16:11,146 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 102 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:11,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 420 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:16:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-24 11:16:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 188. [2024-10-24 11:16:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:16:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 270 transitions. [2024-10-24 11:16:11,176 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 270 transitions. Word has length 170 [2024-10-24 11:16:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:11,176 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 270 transitions. [2024-10-24 11:16:11,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 270 transitions. [2024-10-24 11:16:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-24 11:16:11,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:11,182 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:11,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:11,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:11,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:11,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash 495958599, now seen corresponding path program 1 times [2024-10-24 11:16:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:11,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962155215] [2024-10-24 11:16:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:11,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:11,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:11,387 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:11,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:16:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:11,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:16:11,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:11,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:11,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962155215] [2024-10-24 11:16:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962155215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:11,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:11,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:16:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770218601] [2024-10-24 11:16:11,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:11,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:16:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:11,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:16:11,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:16:11,830 INFO L87 Difference]: Start difference. First operand 188 states and 270 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:11,899 INFO L93 Difference]: Finished difference Result 314 states and 452 transitions. [2024-10-24 11:16:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:16:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-10-24 11:16:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:11,901 INFO L225 Difference]: With dead ends: 314 [2024-10-24 11:16:11,901 INFO L226 Difference]: Without dead ends: 186 [2024-10-24 11:16:11,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:16:11,903 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:11,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:16:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-24 11:16:11,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-10-24 11:16:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.27007299270073) internal successors, (174), 137 states have internal predecessors, (174), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:16:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 266 transitions. [2024-10-24 11:16:11,920 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 266 transitions. Word has length 173 [2024-10-24 11:16:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:11,921 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 266 transitions. [2024-10-24 11:16:11,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 266 transitions. [2024-10-24 11:16:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:16:11,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:11,923 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:11,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 11:16:12,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:12,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:12,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash 884410523, now seen corresponding path program 1 times [2024-10-24 11:16:12,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:12,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322390286] [2024-10-24 11:16:12,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:12,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:12,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:12,126 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:12,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 11:16:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:12,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:16:12,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:12,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:16:12,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:16:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:13,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:13,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:13,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322390286] [2024-10-24 11:16:13,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322390286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:13,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:13,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:16:13,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574208092] [2024-10-24 11:16:13,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:13,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:16:13,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:13,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:16:13,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:16:13,089 INFO L87 Difference]: Start difference. First operand 186 states and 266 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:14,197 INFO L93 Difference]: Finished difference Result 456 states and 652 transitions. [2024-10-24 11:16:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:16:14,198 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:16:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:14,200 INFO L225 Difference]: With dead ends: 456 [2024-10-24 11:16:14,201 INFO L226 Difference]: Without dead ends: 330 [2024-10-24 11:16:14,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:16:14,202 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 150 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:14,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 2051 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:16:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-24 11:16:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 225. [2024-10-24 11:16:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 176 states have internal predecessors, (226), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:16:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 318 transitions. [2024-10-24 11:16:14,230 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 318 transitions. Word has length 175 [2024-10-24 11:16:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:14,231 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 318 transitions. [2024-10-24 11:16:14,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 318 transitions. [2024-10-24 11:16:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:16:14,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:14,233 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:14,249 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-24 11:16:14,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:14,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:14,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:14,435 INFO L85 PathProgramCache]: Analyzing trace with hash 749548951, now seen corresponding path program 1 times [2024-10-24 11:16:14,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:14,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798121457] [2024-10-24 11:16:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:14,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:14,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:14,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:14,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 11:16:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:14,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:16:14,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:14,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:14,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:14,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798121457] [2024-10-24 11:16:14,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798121457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:14,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:14,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:16:14,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965769536] [2024-10-24 11:16:14,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:14,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:16:14,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:15,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:16:15,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:16:15,000 INFO L87 Difference]: Start difference. First operand 225 states and 318 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:15,442 INFO L93 Difference]: Finished difference Result 447 states and 623 transitions. [2024-10-24 11:16:15,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:16:15,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:16:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:15,447 INFO L225 Difference]: With dead ends: 447 [2024-10-24 11:16:15,447 INFO L226 Difference]: Without dead ends: 282 [2024-10-24 11:16:15,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:16:15,449 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 49 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:15,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 697 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:16:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-24 11:16:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 276. [2024-10-24 11:16:15,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 219 states have (on average 1.269406392694064) internal successors, (278), 220 states have internal predecessors, (278), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 11:16:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 382 transitions. [2024-10-24 11:16:15,476 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 382 transitions. Word has length 175 [2024-10-24 11:16:15,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:15,477 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 382 transitions. [2024-10-24 11:16:15,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 382 transitions. [2024-10-24 11:16:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:16:15,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:15,480 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:15,495 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-24 11:16:15,681 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-24 11:16:15,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:15,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:15,682 INFO L85 PathProgramCache]: Analyzing trace with hash -261568299, now seen corresponding path program 1 times [2024-10-24 11:16:15,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:15,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928273929] [2024-10-24 11:16:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:15,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:15,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:15,684 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:15,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 11:16:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:16,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 11:16:16,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:16,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:16:16,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-24 11:16:18,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2024-10-24 11:16:18,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:16:18,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:18,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 87 [2024-10-24 11:16:18,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:16:18,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 23 [2024-10-24 11:16:19,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:19,074 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 115 treesize of output 55 [2024-10-24 11:16:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 456 proven. 45 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-10-24 11:16:19,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:16:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:19,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:19,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928273929] [2024-10-24 11:16:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928273929] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:16:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:16:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2024-10-24 11:16:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636089141] [2024-10-24 11:16:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:19,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:16:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:16:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:16:19,647 INFO L87 Difference]: Start difference. First operand 276 states and 382 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:19,892 INFO L93 Difference]: Finished difference Result 629 states and 868 transitions. [2024-10-24 11:16:19,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:16:19,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:16:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:19,897 INFO L225 Difference]: With dead ends: 629 [2024-10-24 11:16:19,897 INFO L226 Difference]: Without dead ends: 417 [2024-10-24 11:16:19,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:16:19,899 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 117 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:19,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 398 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:16:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-24 11:16:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 338. [2024-10-24 11:16:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 281 states have (on average 1.295373665480427) internal successors, (364), 282 states have internal predecessors, (364), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 11:16:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 468 transitions. [2024-10-24 11:16:19,925 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 468 transitions. Word has length 175 [2024-10-24 11:16:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:19,936 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 468 transitions. [2024-10-24 11:16:19,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 468 transitions. [2024-10-24 11:16:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:16:19,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:19,939 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:19,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 11:16:20,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:20,140 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:20,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash 812436631, now seen corresponding path program 1 times [2024-10-24 11:16:20,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:20,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086220318] [2024-10-24 11:16:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:20,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:20,143 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:20,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 11:16:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:20,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:16:20,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:20,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:20,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:20,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086220318] [2024-10-24 11:16:20,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086220318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:20,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:20,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:16:20,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686456598] [2024-10-24 11:16:20,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:20,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:16:20,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:20,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:16:20,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:16:20,640 INFO L87 Difference]: Start difference. First operand 338 states and 468 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:21,112 INFO L93 Difference]: Finished difference Result 629 states and 867 transitions. [2024-10-24 11:16:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:16:21,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:16:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:21,115 INFO L225 Difference]: With dead ends: 629 [2024-10-24 11:16:21,115 INFO L226 Difference]: Without dead ends: 355 [2024-10-24 11:16:21,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 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-24 11:16:21,116 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 75 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:21,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 690 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:16:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-24 11:16:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 309. [2024-10-24 11:16:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 252 states have (on average 1.2817460317460319) internal successors, (323), 253 states have internal predecessors, (323), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 11:16:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 427 transitions. [2024-10-24 11:16:21,131 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 427 transitions. Word has length 175 [2024-10-24 11:16:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:21,131 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 427 transitions. [2024-10-24 11:16:21,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 427 transitions. [2024-10-24 11:16:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:16:21,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:21,133 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:21,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:21,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:21,333 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:21,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:21,334 INFO L85 PathProgramCache]: Analyzing trace with hash -771041389, now seen corresponding path program 1 times [2024-10-24 11:16:21,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:21,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815454850] [2024-10-24 11:16:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:21,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:21,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:21,336 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:21,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 11:16:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:21,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 11:16:21,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:21,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:16:22,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2024-10-24 11:16:22,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:16:22,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 69 [2024-10-24 11:16:22,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 4 [2024-10-24 11:16:22,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:22,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 47 [2024-10-24 11:16:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-10-24 11:16:23,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:16:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:23,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815454850] [2024-10-24 11:16:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815454850] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:16:23,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:16:23,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-10-24 11:16:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950502573] [2024-10-24 11:16:23,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:23,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:16:23,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:16:23,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:16:23,538 INFO L87 Difference]: Start difference. First operand 309 states and 427 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:23,945 INFO L93 Difference]: Finished difference Result 699 states and 958 transitions. [2024-10-24 11:16:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:16:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:16:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:23,950 INFO L225 Difference]: With dead ends: 699 [2024-10-24 11:16:23,950 INFO L226 Difference]: Without dead ends: 454 [2024-10-24 11:16:23,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:16:23,951 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 66 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:23,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 552 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:16:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-10-24 11:16:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 449. [2024-10-24 11:16:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 375 states have (on average 1.2826666666666666) internal successors, (481), 378 states have internal predecessors, (481), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-24 11:16:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 613 transitions. [2024-10-24 11:16:23,975 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 613 transitions. Word has length 175 [2024-10-24 11:16:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:23,976 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 613 transitions. [2024-10-24 11:16:23,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 613 transitions. [2024-10-24 11:16:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:16:23,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:23,978 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:23,993 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-24 11:16:24,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:24,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:24,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash -709001775, now seen corresponding path program 1 times [2024-10-24 11:16:24,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:24,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196150631] [2024-10-24 11:16:24,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:24,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:24,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:24,181 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:24,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 11:16:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:24,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:16:24,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:24,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:24,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:24,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196150631] [2024-10-24 11:16:24,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196150631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:24,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:24,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:16:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478254684] [2024-10-24 11:16:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:24,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:16:24,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:24,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:16:24,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:16:24,614 INFO L87 Difference]: Start difference. First operand 449 states and 613 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:25,039 INFO L93 Difference]: Finished difference Result 875 states and 1187 transitions. [2024-10-24 11:16:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:16:25,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:16:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:25,043 INFO L225 Difference]: With dead ends: 875 [2024-10-24 11:16:25,043 INFO L226 Difference]: Without dead ends: 494 [2024-10-24 11:16:25,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:16:25,045 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 77 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:25,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 886 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:16:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-24 11:16:25,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 348. [2024-10-24 11:16:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 286 states have (on average 1.2692307692307692) internal successors, (363), 287 states have internal predecessors, (363), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 11:16:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 471 transitions. [2024-10-24 11:16:25,062 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 471 transitions. Word has length 175 [2024-10-24 11:16:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:25,063 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 471 transitions. [2024-10-24 11:16:25,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 471 transitions. [2024-10-24 11:16:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:16:25,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:25,064 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:25,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-24 11:16:25,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:25,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:25,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash 302963541, now seen corresponding path program 1 times [2024-10-24 11:16:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484195170] [2024-10-24 11:16:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:25,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:25,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:25,268 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:25,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 11:16:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:25,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 11:16:25,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:25,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:16:25,941 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 41 treesize of output 19 [2024-10-24 11:16:27,437 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 61 treesize of output 45 [2024-10-24 11:16:27,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:16:27,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2024-10-24 11:16:27,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 4 [2024-10-24 11:16:27,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:27,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 43 [2024-10-24 11:16:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 45 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-10-24 11:16:28,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:16:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:28,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:28,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484195170] [2024-10-24 11:16:28,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484195170] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:16:28,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:16:28,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2024-10-24 11:16:28,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160733677] [2024-10-24 11:16:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:28,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:16:28,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:28,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:16:28,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:16:28,466 INFO L87 Difference]: Start difference. First operand 348 states and 471 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:28,768 INFO L93 Difference]: Finished difference Result 700 states and 945 transitions. [2024-10-24 11:16:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:16:28,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:16:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:28,772 INFO L225 Difference]: With dead ends: 700 [2024-10-24 11:16:28,772 INFO L226 Difference]: Without dead ends: 420 [2024-10-24 11:16:28,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:16:28,773 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 119 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:28,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 520 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:16:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-24 11:16:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 346. [2024-10-24 11:16:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 284 states have (on average 1.2605633802816902) internal successors, (358), 285 states have internal predecessors, (358), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 11:16:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 466 transitions. [2024-10-24 11:16:28,789 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 466 transitions. Word has length 175 [2024-10-24 11:16:28,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:28,789 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 466 transitions. [2024-10-24 11:16:28,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 466 transitions. [2024-10-24 11:16:28,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:16:28,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:28,791 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:28,805 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 (14)] Ended with exit code 0 [2024-10-24 11:16:28,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:28,992 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:28,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash -708153709, now seen corresponding path program 1 times [2024-10-24 11:16:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991094668] [2024-10-24 11:16:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:28,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:28,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:28,994 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:28,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 11:16:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:29,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 11:16:29,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:29,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:16:30,132 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 51 treesize of output 37 [2024-10-24 11:16:30,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:16:30,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2024-10-24 11:16:30,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2024-10-24 11:16:30,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:30,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 35 [2024-10-24 11:16:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-10-24 11:16:30,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:16:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:31,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991094668] [2024-10-24 11:16:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991094668] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:16:31,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:16:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-10-24 11:16:31,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850952711] [2024-10-24 11:16:31,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:31,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:16:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:16:31,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:16:31,205 INFO L87 Difference]: Start difference. First operand 346 states and 466 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:31,567 INFO L93 Difference]: Finished difference Result 629 states and 844 transitions. [2024-10-24 11:16:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:16:31,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:16:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:31,570 INFO L225 Difference]: With dead ends: 629 [2024-10-24 11:16:31,570 INFO L226 Difference]: Without dead ends: 351 [2024-10-24 11:16:31,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:16:31,571 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 119 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:31,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 528 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:16:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-24 11:16:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 303. [2024-10-24 11:16:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 250 states have (on average 1.26) internal successors, (315), 250 states have internal predecessors, (315), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:16:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 407 transitions. [2024-10-24 11:16:31,584 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 407 transitions. Word has length 175 [2024-10-24 11:16:31,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:31,585 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 407 transitions. [2024-10-24 11:16:31,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 407 transitions. [2024-10-24 11:16:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:16:31,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:31,586 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:31,602 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 (15)] Ended with exit code 0 [2024-10-24 11:16:31,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:31,787 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:31,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash -449988271, now seen corresponding path program 1 times [2024-10-24 11:16:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:31,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252086364] [2024-10-24 11:16:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:31,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:31,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:31,791 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:31,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 11:16:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:32,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:16:32,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:32,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:32,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252086364] [2024-10-24 11:16:32,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252086364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:32,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:32,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:16:32,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451069480] [2024-10-24 11:16:32,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:32,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:16:32,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:32,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:16:32,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:16:32,280 INFO L87 Difference]: Start difference. First operand 303 states and 407 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:32,676 INFO L93 Difference]: Finished difference Result 580 states and 776 transitions. [2024-10-24 11:16:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:16:32,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:16:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:32,679 INFO L225 Difference]: With dead ends: 580 [2024-10-24 11:16:32,679 INFO L226 Difference]: Without dead ends: 345 [2024-10-24 11:16:32,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:16:32,680 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 49 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:32,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 801 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:16:32,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-24 11:16:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 303. [2024-10-24 11:16:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 250 states have (on average 1.256) internal successors, (314), 250 states have internal predecessors, (314), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:16:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 406 transitions. [2024-10-24 11:16:32,700 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 406 transitions. Word has length 175 [2024-10-24 11:16:32,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:32,700 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 406 transitions. [2024-10-24 11:16:32,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 406 transitions. [2024-10-24 11:16:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 11:16:32,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:32,703 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:32,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-24 11:16:32,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:32,904 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:32,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash -843015281, now seen corresponding path program 1 times [2024-10-24 11:16:32,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:32,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143354539] [2024-10-24 11:16:32,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:32,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:32,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:32,906 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:32,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 11:16:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:33,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 11:16:33,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:33,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:16:33,729 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 42 treesize of output 20 [2024-10-24 11:16:33,841 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-24 11:16:35,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:35,506 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 47 treesize of output 43 [2024-10-24 11:16:35,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:35,912 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 80 treesize of output 38 [2024-10-24 11:16:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 458 proven. 102 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-10-24 11:16:36,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:16:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:37,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:37,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143354539] [2024-10-24 11:16:37,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143354539] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:16:37,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:16:37,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 23 [2024-10-24 11:16:37,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268949655] [2024-10-24 11:16:37,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:37,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:16:37,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:37,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:16:37,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:16:37,108 INFO L87 Difference]: Start difference. First operand 303 states and 406 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:38,171 INFO L93 Difference]: Finished difference Result 570 states and 763 transitions. [2024-10-24 11:16:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:16:38,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-24 11:16:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:38,173 INFO L225 Difference]: With dead ends: 570 [2024-10-24 11:16:38,173 INFO L226 Difference]: Without dead ends: 335 [2024-10-24 11:16:38,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:16:38,176 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 57 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:38,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1459 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:16:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-24 11:16:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2024-10-24 11:16:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 274 states have (on average 1.2591240875912408) internal successors, (345), 275 states have internal predecessors, (345), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:16:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 445 transitions. [2024-10-24 11:16:38,201 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 445 transitions. Word has length 175 [2024-10-24 11:16:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:38,201 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 445 transitions. [2024-10-24 11:16:38,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 445 transitions. [2024-10-24 11:16:38,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 11:16:38,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:38,202 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:38,219 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 (17)] Ended with exit code 0 [2024-10-24 11:16:38,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:38,403 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:38,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:38,404 INFO L85 PathProgramCache]: Analyzing trace with hash 816954960, now seen corresponding path program 1 times [2024-10-24 11:16:38,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:38,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727255412] [2024-10-24 11:16:38,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:38,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:38,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:38,408 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:38,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-24 11:16:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:38,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:16:38,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:38,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:16:38,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:38,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727255412] [2024-10-24 11:16:38,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727255412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:38,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:38,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:16:38,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239193929] [2024-10-24 11:16:38,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:38,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:16:38,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:38,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:16:38,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:16:38,782 INFO L87 Difference]: Start difference. First operand 332 states and 445 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:38,871 INFO L93 Difference]: Finished difference Result 602 states and 807 transitions. [2024-10-24 11:16:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:16:38,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2024-10-24 11:16:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:38,874 INFO L225 Difference]: With dead ends: 602 [2024-10-24 11:16:38,874 INFO L226 Difference]: Without dead ends: 338 [2024-10-24 11:16:38,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:16:38,875 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:38,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 582 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:16:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-24 11:16:38,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-10-24 11:16:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 280 states have (on average 1.2535714285714286) internal successors, (351), 281 states have internal predecessors, (351), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:16:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 451 transitions. [2024-10-24 11:16:38,897 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 451 transitions. Word has length 177 [2024-10-24 11:16:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:38,897 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 451 transitions. [2024-10-24 11:16:38,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 451 transitions. [2024-10-24 11:16:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 11:16:38,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:38,901 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:38,915 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 (18)] Forceful destruction successful, exit code 0 [2024-10-24 11:16:39,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:39,102 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:39,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:39,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1212426507, now seen corresponding path program 1 times [2024-10-24 11:16:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:16:39,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401017845] [2024-10-24 11:16:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:39,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:16:39,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:16:39,106 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:16:39,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-24 11:16:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:39,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:16:39,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:39,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:16:40,531 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 44 treesize of output 31 [2024-10-24 11:16:41,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:41,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 40 [2024-10-24 11:16:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-24 11:16:41,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:16:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 11:16:41,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:16:41,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401017845] [2024-10-24 11:16:41,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401017845] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:16:41,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:16:41,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2024-10-24 11:16:41,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840666947] [2024-10-24 11:16:41,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:41,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:16:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:16:41,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:16:41,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:16:41,631 INFO L87 Difference]: Start difference. First operand 338 states and 451 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:45,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:16:49,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:16:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:50,114 INFO L93 Difference]: Finished difference Result 596 states and 789 transitions. [2024-10-24 11:16:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:16:50,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2024-10-24 11:16:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:50,117 INFO L225 Difference]: With dead ends: 596 [2024-10-24 11:16:50,118 INFO L226 Difference]: Without dead ends: 594 [2024-10-24 11:16:50,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:16:50,120 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 89 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:50,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 888 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2024-10-24 11:16:50,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-10-24 11:16:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 591. [2024-10-24 11:16:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 510 states have (on average 1.2627450980392156) internal successors, (644), 513 states have internal predecessors, (644), 69 states have call successors, (69), 11 states have call predecessors, (69), 11 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-24 11:16:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 782 transitions. [2024-10-24 11:16:50,156 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 782 transitions. Word has length 179 [2024-10-24 11:16:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:50,157 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 782 transitions. [2024-10-24 11:16:50,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 11:16:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 782 transitions. [2024-10-24 11:16:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 11:16:50,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:50,159 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:50,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0