./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd --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 c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:49:17,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:49:17,881 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:49:17,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:49:17,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:49:17,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:49:17,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:49:17,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:49:17,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:49:17,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:49:17,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:49:17,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:49:17,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:49:17,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:49:17,916 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:49:17,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:49:17,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:49:17,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:49:17,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:49:17,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:49:17,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:49:17,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:49:17,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:49:17,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:49:17,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:49:17,918 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:49:17,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:49:17,918 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:49:17,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:49:17,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:49:17,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:49:17,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:49:17,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:49:17,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:49:17,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:49:17,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:49:17,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:49:17,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:49:17,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:49:17,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:49:17,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:49:17,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:49:17,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd 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 -> c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f [2024-11-13 13:49:18,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:49:18,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:49:18,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:49:18,308 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:49:18,309 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:49:18,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i Unable to find full path for "g++" [2024-11-13 13:49:20,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:49:20,991 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:49:20,992 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2024-11-13 13:49:21,002 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/data/8d62b6448/66f0471a7a1e4e318574a9cf466cf8d9/FLAGfefaa73bc [2024-11-13 13:49:21,021 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/data/8d62b6448/66f0471a7a1e4e318574a9cf466cf8d9 [2024-11-13 13:49:21,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:49:21,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:49:21,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:49:21,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:49:21,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:49:21,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505cd523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21, skipping insertion in model container [2024-11-13 13:49:21,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:49:21,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2024-11-13 13:49:21,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:49:21,340 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:49:21,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2024-11-13 13:49:21,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:49:21,421 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:49:21,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21 WrapperNode [2024-11-13 13:49:21,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:49:21,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:49:21,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:49:21,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:49:21,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,488 INFO L138 Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 436 [2024-11-13 13:49:21,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:49:21,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:49:21,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:49:21,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:49:21,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,512 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-13 13:49:21,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:49:21,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:49:21,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:49:21,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:49:21,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (1/1) ... [2024-11-13 13:49:21,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:49:21,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:49:21,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:49:21,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:49:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:49:21,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-13 13:49:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-13 13:49:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 13:49:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-13 13:49:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-13 13:49:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 13:49:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:49:21,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:49:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 13:49:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:49:21,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:49:21,801 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:49:21,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:49:22,766 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-11-13 13:49:22,766 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:49:22,780 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:49:22,781 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:49:22,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:49:22 BoogieIcfgContainer [2024-11-13 13:49:22,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:49:22,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:49:22,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:49:22,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:49:22,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:49:21" (1/3) ... [2024-11-13 13:49:22,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474ee7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:49:22, skipping insertion in model container [2024-11-13 13:49:22,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:49:21" (2/3) ... [2024-11-13 13:49:22,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474ee7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:49:22, skipping insertion in model container [2024-11-13 13:49:22,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:49:22" (3/3) ... [2024-11-13 13:49:22,799 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-34.i [2024-11-13 13:49:22,822 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:49:22,824 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-34.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:49:22,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:49:22,922 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;@2f47fa03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:49:22,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:49:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 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-11-13 13:49:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 13:49:22,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:22,940 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-11-13 13:49:22,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:22,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash -290842204, now seen corresponding path program 1 times [2024-11-13 13:49:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:22,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214336202] [2024-11-13 13:49:22,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:22,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:23,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214336202] [2024-11-13 13:49:23,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214336202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:23,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:23,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:49:23,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787237957] [2024-11-13 13:49:23,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:23,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:49:23,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:23,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:49:23,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:49:23,801 INFO L87 Difference]: Start difference. First operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 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.5) internal successors, (59), 2 states have internal predecessors, (59), 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-11-13 13:49:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:23,857 INFO L93 Difference]: Finished difference Result 233 states and 367 transitions. [2024-11-13 13:49:23,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:49:23,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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 171 [2024-11-13 13:49:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:23,871 INFO L225 Difference]: With dead ends: 233 [2024-11-13 13:49:23,871 INFO L226 Difference]: Without dead ends: 116 [2024-11-13 13:49:23,876 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-11-13 13:49:23,883 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:23,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:49:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-13 13:49:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-13 13:49:23,949 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-11-13 13:49:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-13 13:49:23,960 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2024-11-13 13:49:23,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:23,961 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-13 13:49:23,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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-11-13 13:49:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-13 13:49:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 13:49:23,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:23,968 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-11-13 13:49:23,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:49:23,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:23,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1660958274, now seen corresponding path program 1 times [2024-11-13 13:49:23,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:23,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588136844] [2024-11-13 13:49:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:23,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:24,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:24,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588136844] [2024-11-13 13:49:24,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588136844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:24,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:24,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:49:24,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129059272] [2024-11-13 13:49:24,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:24,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:24,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:24,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:24,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:24,599 INFO L87 Difference]: Start difference. First operand 116 states and 168 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-11-13 13:49:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:24,661 INFO L93 Difference]: Finished difference Result 230 states and 335 transitions. [2024-11-13 13:49:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:24,662 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-11-13 13:49:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:24,665 INFO L225 Difference]: With dead ends: 230 [2024-11-13 13:49:24,665 INFO L226 Difference]: Without dead ends: 117 [2024-11-13 13:49:24,666 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-11-13 13:49:24,669 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:24,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:49:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-13 13:49:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-13 13:49:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 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-11-13 13:49:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-11-13 13:49:24,688 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 171 [2024-11-13 13:49:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:24,690 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-11-13 13:49:24,690 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-11-13 13:49:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-11-13 13:49:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 13:49:24,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:24,693 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-11-13 13:49:24,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:49:24,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:24,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash 843309824, now seen corresponding path program 1 times [2024-11-13 13:49:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:24,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845202373] [2024-11-13 13:49:24,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:24,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:25,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:25,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845202373] [2024-11-13 13:49:25,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845202373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:25,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:25,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:49:25,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054860364] [2024-11-13 13:49:25,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:25,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:49:25,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:25,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:49:25,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:49:25,433 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-11-13 13:49:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:25,482 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2024-11-13 13:49:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:49:25,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-11-13 13:49:25,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:25,485 INFO L225 Difference]: With dead ends: 233 [2024-11-13 13:49:25,485 INFO L226 Difference]: Without dead ends: 119 [2024-11-13 13:49:25,486 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-11-13 13:49:25,487 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:25,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:49:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-13 13:49:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-13 13:49:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 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-11-13 13:49:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-13 13:49:25,500 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 171 [2024-11-13 13:49:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:25,501 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-13 13:49:25,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-11-13 13:49:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-13 13:49:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 13:49:25,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:25,504 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-11-13 13:49:25,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:49:25,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:25,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:25,505 INFO L85 PathProgramCache]: Analyzing trace with hash -411238670, now seen corresponding path program 1 times [2024-11-13 13:49:25,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:25,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455786697] [2024-11-13 13:49:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:25,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:25,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455786697] [2024-11-13 13:49:25,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455786697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:25,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:25,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:49:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836426845] [2024-11-13 13:49:25,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:25,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:25,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:25,855 INFO L87 Difference]: Start difference. First operand 119 states and 171 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-11-13 13:49:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:25,904 INFO L93 Difference]: Finished difference Result 285 states and 411 transitions. [2024-11-13 13:49:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:25,905 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-11-13 13:49:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:25,909 INFO L225 Difference]: With dead ends: 285 [2024-11-13 13:49:25,910 INFO L226 Difference]: Without dead ends: 169 [2024-11-13 13:49:25,910 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-11-13 13:49:25,911 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:25,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 323 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:49:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-13 13:49:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 138. [2024-11-13 13:49:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 113 states have internal predecessors, (153), 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-11-13 13:49:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions. [2024-11-13 13:49:25,934 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 173 [2024-11-13 13:49:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:25,938 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 199 transitions. [2024-11-13 13:49:25,938 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-11-13 13:49:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2024-11-13 13:49:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 13:49:25,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:25,946 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] [2024-11-13 13:49:25,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:49:25,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:25,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2084291619, now seen corresponding path program 1 times [2024-11-13 13:49:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843236603] [2024-11-13 13:49:25,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:27,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:27,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843236603] [2024-11-13 13:49:27,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843236603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:27,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:27,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:49:27,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305259985] [2024-11-13 13:49:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:27,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:27,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:27,265 INFO L87 Difference]: Start difference. First operand 138 states and 199 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-13 13:49:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:28,062 INFO L93 Difference]: Finished difference Result 269 states and 389 transitions. [2024-11-13 13:49:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:49:28,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 176 [2024-11-13 13:49:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:28,064 INFO L225 Difference]: With dead ends: 269 [2024-11-13 13:49:28,065 INFO L226 Difference]: Without dead ends: 134 [2024-11-13 13:49:28,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:49:28,066 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 193 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:28,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 250 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:49:28,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-13 13:49:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2024-11-13 13:49:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.3364485981308412) internal successors, (143), 107 states have internal predecessors, (143), 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-11-13 13:49:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2024-11-13 13:49:28,093 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 189 transitions. Word has length 176 [2024-11-13 13:49:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:28,094 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 189 transitions. [2024-11-13 13:49:28,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-13 13:49:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2024-11-13 13:49:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 13:49:28,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:28,104 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] [2024-11-13 13:49:28,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:49:28,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:28,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:28,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1752209511, now seen corresponding path program 1 times [2024-11-13 13:49:28,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:28,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939193097] [2024-11-13 13:49:28,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:28,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:29,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939193097] [2024-11-13 13:49:29,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939193097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:29,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:29,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:49:29,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719070721] [2024-11-13 13:49:29,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:29,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:49:29,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:29,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:49:29,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:49:29,443 INFO L87 Difference]: Start difference. First operand 132 states and 189 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-13 13:49:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:30,364 INFO L93 Difference]: Finished difference Result 259 states and 372 transitions. [2024-11-13 13:49:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:49:30,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 178 [2024-11-13 13:49:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:30,367 INFO L225 Difference]: With dead ends: 259 [2024-11-13 13:49:30,367 INFO L226 Difference]: Without dead ends: 130 [2024-11-13 13:49:30,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:49:30,368 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 172 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:30,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 289 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:49:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-13 13:49:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-13 13:49:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 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-11-13 13:49:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 185 transitions. [2024-11-13 13:49:30,382 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 185 transitions. Word has length 178 [2024-11-13 13:49:30,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:30,383 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 185 transitions. [2024-11-13 13:49:30,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-13 13:49:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 185 transitions. [2024-11-13 13:49:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 13:49:30,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:30,386 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] [2024-11-13 13:49:30,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:49:30,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:30,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:30,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1656544443, now seen corresponding path program 1 times [2024-11-13 13:49:30,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:30,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593263844] [2024-11-13 13:49:30,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:30,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:30,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593263844] [2024-11-13 13:49:30,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593263844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:30,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:30,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:49:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312368481] [2024-11-13 13:49:30,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:30,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:49:30,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:30,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:49:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:49:30,627 INFO L87 Difference]: Start difference. First operand 130 states and 185 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (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-11-13 13:49:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:30,749 INFO L93 Difference]: Finished difference Result 283 states and 402 transitions. [2024-11-13 13:49:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:49:30,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (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 178 [2024-11-13 13:49:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:30,752 INFO L225 Difference]: With dead ends: 283 [2024-11-13 13:49:30,752 INFO L226 Difference]: Without dead ends: 156 [2024-11-13 13:49:30,752 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-11-13 13:49:30,753 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 51 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:30,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 356 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:49:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-13 13:49:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2024-11-13 13:49:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 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-11-13 13:49:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2024-11-13 13:49:30,767 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 178 [2024-11-13 13:49:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:30,768 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2024-11-13 13:49:30,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (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-11-13 13:49:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2024-11-13 13:49:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:30,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:30,770 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, 1] [2024-11-13 13:49:30,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:49:30,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:30,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:30,771 INFO L85 PathProgramCache]: Analyzing trace with hash -197232459, now seen corresponding path program 1 times [2024-11-13 13:49:30,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:30,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890674215] [2024-11-13 13:49:30,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:30,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:30,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:31,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-11-13 13:49:31,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890674215] [2024-11-13 13:49:31,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890674215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:31,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:31,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:49:31,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891676377] [2024-11-13 13:49:31,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:31,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:49:31,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:31,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:49:31,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:49:31,042 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-11-13 13:49:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:31,088 INFO L93 Difference]: Finished difference Result 260 states and 365 transitions. [2024-11-13 13:49:31,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:49:31,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:31,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:31,096 INFO L225 Difference]: With dead ends: 260 [2024-11-13 13:49:31,096 INFO L226 Difference]: Without dead ends: 133 [2024-11-13 13:49:31,097 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-11-13 13:49:31,098 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:31,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:49:31,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-13 13:49:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-13 13:49:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 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-11-13 13:49:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2024-11-13 13:49:31,115 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 180 [2024-11-13 13:49:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:31,116 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2024-11-13 13:49:31,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-11-13 13:49:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2024-11-13 13:49:31,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:31,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:31,119 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, 1] [2024-11-13 13:49:31,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:49:31,119 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:31,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash -898297037, now seen corresponding path program 1 times [2024-11-13 13:49:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:31,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844640823] [2024-11-13 13:49:31,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:31,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:33,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:33,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844640823] [2024-11-13 13:49:33,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844640823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:33,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:33,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:49:33,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517440669] [2024-11-13 13:49:33,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:33,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:33,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:33,314 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:33,747 INFO L93 Difference]: Finished difference Result 331 states and 457 transitions. [2024-11-13 13:49:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:49:33,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:33,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:33,749 INFO L225 Difference]: With dead ends: 331 [2024-11-13 13:49:33,749 INFO L226 Difference]: Without dead ends: 202 [2024-11-13 13:49:33,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:49:33,751 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 109 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:33,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 422 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:49:33,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-13 13:49:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2024-11-13 13:49:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 171 states have internal predecessors, (222), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:49:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 272 transitions. [2024-11-13 13:49:33,776 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 272 transitions. Word has length 180 [2024-11-13 13:49:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:33,779 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 272 transitions. [2024-11-13 13:49:33,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 272 transitions. [2024-11-13 13:49:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:33,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:33,782 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, 1] [2024-11-13 13:49:33,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:49:33,782 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:33,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash 381566641, now seen corresponding path program 1 times [2024-11-13 13:49:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:33,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901680822] [2024-11-13 13:49:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:33,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:34,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:35,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:35,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901680822] [2024-11-13 13:49:35,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901680822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:35,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:35,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:49:35,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71381099] [2024-11-13 13:49:35,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:35,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:49:35,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:35,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:49:35,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:49:35,082 INFO L87 Difference]: Start difference. First operand 198 states and 272 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-11-13 13:49:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:36,038 INFO L93 Difference]: Finished difference Result 604 states and 828 transitions. [2024-11-13 13:49:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:49:36,039 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:36,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:36,044 INFO L225 Difference]: With dead ends: 604 [2024-11-13 13:49:36,046 INFO L226 Difference]: Without dead ends: 409 [2024-11-13 13:49:36,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:49:36,051 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 139 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:36,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1241 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:49:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-13 13:49:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 268. [2024-11-13 13:49:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 240 states have (on average 1.3041666666666667) internal successors, (313), 241 states have internal predecessors, (313), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:49:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 363 transitions. [2024-11-13 13:49:36,091 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 363 transitions. Word has length 180 [2024-11-13 13:49:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:36,092 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 363 transitions. [2024-11-13 13:49:36,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-11-13 13:49:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 363 transitions. [2024-11-13 13:49:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:36,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:36,096 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, 1] [2024-11-13 13:49:36,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:49:36,097 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:36,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash 495825205, now seen corresponding path program 1 times [2024-11-13 13:49:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531232269] [2024-11-13 13:49:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:36,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:36,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531232269] [2024-11-13 13:49:36,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531232269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:36,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:36,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:49:36,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736952117] [2024-11-13 13:49:36,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:36,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:36,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:36,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:36,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:36,815 INFO L87 Difference]: Start difference. First operand 268 states and 363 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:37,121 INFO L93 Difference]: Finished difference Result 605 states and 814 transitions. [2024-11-13 13:49:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:49:37,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:37,125 INFO L225 Difference]: With dead ends: 605 [2024-11-13 13:49:37,128 INFO L226 Difference]: Without dead ends: 340 [2024-11-13 13:49:37,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:49:37,130 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 80 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:37,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 496 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:49:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-13 13:49:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 264. [2024-11-13 13:49:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 237 states have internal predecessors, (307), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:49:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 357 transitions. [2024-11-13 13:49:37,171 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 357 transitions. Word has length 180 [2024-11-13 13:49:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:37,172 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 357 transitions. [2024-11-13 13:49:37,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 357 transitions. [2024-11-13 13:49:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:37,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:37,178 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, 1] [2024-11-13 13:49:37,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:49:37,179 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:37,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:37,179 INFO L85 PathProgramCache]: Analyzing trace with hash 522115251, now seen corresponding path program 1 times [2024-11-13 13:49:37,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:37,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722604905] [2024-11-13 13:49:37,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:37,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722604905] [2024-11-13 13:49:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722604905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:37,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:37,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:49:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279958524] [2024-11-13 13:49:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:37,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:49:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:37,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:49:37,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:49:37,464 INFO L87 Difference]: Start difference. First operand 264 states and 357 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-11-13 13:49:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:37,513 INFO L93 Difference]: Finished difference Result 533 states and 723 transitions. [2024-11-13 13:49:37,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:49:37,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:37,519 INFO L225 Difference]: With dead ends: 533 [2024-11-13 13:49:37,519 INFO L226 Difference]: Without dead ends: 272 [2024-11-13 13:49:37,520 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-11-13 13:49:37,521 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:37,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 457 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:49:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-13 13:49:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-11-13 13:49:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 244 states have (on average 1.290983606557377) internal successors, (315), 245 states have internal predecessors, (315), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:49:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 365 transitions. [2024-11-13 13:49:37,556 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 365 transitions. Word has length 180 [2024-11-13 13:49:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:37,557 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 365 transitions. [2024-11-13 13:49:37,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-11-13 13:49:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2024-11-13 13:49:37,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:37,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:37,563 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, 1] [2024-11-13 13:49:37,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:49:37,563 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:37,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:37,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1849624011, now seen corresponding path program 1 times [2024-11-13 13:49:37,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:37,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496688412] [2024-11-13 13:49:37,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:37,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:38,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496688412] [2024-11-13 13:49:38,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496688412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:38,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:38,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:49:38,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519809168] [2024-11-13 13:49:38,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:38,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:38,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:38,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:38,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:38,162 INFO L87 Difference]: Start difference. First operand 272 states and 365 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:38,477 INFO L93 Difference]: Finished difference Result 552 states and 738 transitions. [2024-11-13 13:49:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:49:38,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:38,480 INFO L225 Difference]: With dead ends: 552 [2024-11-13 13:49:38,480 INFO L226 Difference]: Without dead ends: 283 [2024-11-13 13:49:38,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:49:38,482 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 126 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:38,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 503 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:49:38,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-13 13:49:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 243. [2024-11-13 13:49:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.283720930232558) internal successors, (276), 216 states have internal predecessors, (276), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:49:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 326 transitions. [2024-11-13 13:49:38,502 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 326 transitions. Word has length 180 [2024-11-13 13:49:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:38,502 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 326 transitions. [2024-11-13 13:49:38,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 326 transitions. [2024-11-13 13:49:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:38,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:38,505 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, 1] [2024-11-13 13:49:38,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:49:38,505 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:38,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:38,506 INFO L85 PathProgramCache]: Analyzing trace with hash 602164921, now seen corresponding path program 1 times [2024-11-13 13:49:38,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:38,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603161705] [2024-11-13 13:49:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:38,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:40,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:40,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603161705] [2024-11-13 13:49:40,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603161705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:40,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:40,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:49:40,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006902433] [2024-11-13 13:49:40,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:40,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:40,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:40,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:40,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:40,467 INFO L87 Difference]: Start difference. First operand 243 states and 326 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:41,010 INFO L93 Difference]: Finished difference Result 593 states and 791 transitions. [2024-11-13 13:49:41,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:49:41,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:41,015 INFO L225 Difference]: With dead ends: 593 [2024-11-13 13:49:41,016 INFO L226 Difference]: Without dead ends: 353 [2024-11-13 13:49:41,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:49:41,017 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 44 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:41,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 558 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:49:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-13 13:49:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 301. [2024-11-13 13:49:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 273 states have (on average 1.2857142857142858) internal successors, (351), 274 states have internal predecessors, (351), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:49:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 401 transitions. [2024-11-13 13:49:41,049 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 401 transitions. Word has length 180 [2024-11-13 13:49:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:41,050 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 401 transitions. [2024-11-13 13:49:41,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2024-11-13 13:49:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:41,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:41,053 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, 1] [2024-11-13 13:49:41,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:49:41,054 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:41,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:41,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1769574341, now seen corresponding path program 1 times [2024-11-13 13:49:41,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:41,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350347771] [2024-11-13 13:49:41,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:41,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:41,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:41,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350347771] [2024-11-13 13:49:41,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350347771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:41,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:41,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:49:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706555888] [2024-11-13 13:49:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:41,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:41,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:41,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:41,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:41,595 INFO L87 Difference]: Start difference. First operand 301 states and 401 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:42,205 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2024-11-13 13:49:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:49:42,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:42,208 INFO L225 Difference]: With dead ends: 610 [2024-11-13 13:49:42,208 INFO L226 Difference]: Without dead ends: 312 [2024-11-13 13:49:42,209 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-11-13 13:49:42,210 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 66 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:42,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 711 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:49:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-13 13:49:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 239. [2024-11-13 13:49:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 213 states have (on average 1.272300469483568) internal successors, (271), 213 states have internal predecessors, (271), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 13:49:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 317 transitions. [2024-11-13 13:49:42,231 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 317 transitions. Word has length 180 [2024-11-13 13:49:42,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:42,232 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 317 transitions. [2024-11-13 13:49:42,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 317 transitions. [2024-11-13 13:49:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:42,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:42,235 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, 1] [2024-11-13 13:49:42,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:49:42,235 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:42,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1743284295, now seen corresponding path program 1 times [2024-11-13 13:49:42,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:42,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584811589] [2024-11-13 13:49:42,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:44,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:44,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584811589] [2024-11-13 13:49:44,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584811589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:44,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:44,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:49:44,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482693691] [2024-11-13 13:49:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:44,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:44,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:44,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:44,070 INFO L87 Difference]: Start difference. First operand 239 states and 317 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:44,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:44,724 INFO L93 Difference]: Finished difference Result 501 states and 663 transitions. [2024-11-13 13:49:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:49:44,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:44,727 INFO L225 Difference]: With dead ends: 501 [2024-11-13 13:49:44,727 INFO L226 Difference]: Without dead ends: 265 [2024-11-13 13:49:44,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:49:44,729 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 44 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:44,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 626 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:49:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-13 13:49:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 239. [2024-11-13 13:49:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 213 states have (on average 1.2582159624413145) internal successors, (268), 213 states have internal predecessors, (268), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 13:49:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 314 transitions. [2024-11-13 13:49:44,747 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 314 transitions. Word has length 180 [2024-11-13 13:49:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:44,748 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 314 transitions. [2024-11-13 13:49:44,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 314 transitions. [2024-11-13 13:49:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:44,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:44,751 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, 1] [2024-11-13 13:49:44,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 13:49:44,751 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:44,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:44,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1629025731, now seen corresponding path program 1 times [2024-11-13 13:49:44,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:44,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362253910] [2024-11-13 13:49:44,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:44,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:47,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:47,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362253910] [2024-11-13 13:49:47,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362253910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:47,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:47,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 13:49:47,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366725673] [2024-11-13 13:49:47,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:47,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:49:47,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:47,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:49:47,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:49:47,705 INFO L87 Difference]: Start difference. First operand 239 states and 314 transitions. Second operand has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 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-11-13 13:49:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:49,500 INFO L93 Difference]: Finished difference Result 522 states and 685 transitions. [2024-11-13 13:49:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:49:49,501 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:49,503 INFO L225 Difference]: With dead ends: 522 [2024-11-13 13:49:49,503 INFO L226 Difference]: Without dead ends: 286 [2024-11-13 13:49:49,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:49:49,505 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 71 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:49,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1440 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 13:49:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-13 13:49:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2024-11-13 13:49:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 250 states have (on average 1.26) internal successors, (315), 251 states have internal predecessors, (315), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 13:49:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 371 transitions. [2024-11-13 13:49:49,530 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 371 transitions. Word has length 180 [2024-11-13 13:49:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:49,531 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 371 transitions. [2024-11-13 13:49:49,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 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-11-13 13:49:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 371 transitions. [2024-11-13 13:49:49,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:49,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:49,535 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, 1] [2024-11-13 13:49:49,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:49:49,535 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:49,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:49,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1964876987, now seen corresponding path program 1 times [2024-11-13 13:49:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:49,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699114882] [2024-11-13 13:49:49,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:49,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:49,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:49,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699114882] [2024-11-13 13:49:49,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699114882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:49,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:49,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:49:49,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701657078] [2024-11-13 13:49:49,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:49,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:49,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:49,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:49,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:49,982 INFO L87 Difference]: Start difference. First operand 283 states and 371 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:50,535 INFO L93 Difference]: Finished difference Result 621 states and 810 transitions. [2024-11-13 13:49:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:49:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:50,539 INFO L225 Difference]: With dead ends: 621 [2024-11-13 13:49:50,539 INFO L226 Difference]: Without dead ends: 341 [2024-11-13 13:49:50,540 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-11-13 13:49:50,542 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 40 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:50,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 709 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:49:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-13 13:49:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 283. [2024-11-13 13:49:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 250 states have (on average 1.256) internal successors, (314), 251 states have internal predecessors, (314), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 13:49:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 370 transitions. [2024-11-13 13:49:50,573 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 370 transitions. Word has length 180 [2024-11-13 13:49:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:50,574 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 370 transitions. [2024-11-13 13:49:50,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 370 transitions. [2024-11-13 13:49:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:50,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:50,577 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, 1] [2024-11-13 13:49:50,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:49:50,577 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:50,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1050226631, now seen corresponding path program 1 times [2024-11-13 13:49:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:50,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664828977] [2024-11-13 13:49:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:51,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:51,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:51,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:51,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:52,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-11-13 13:49:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:52,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664828977] [2024-11-13 13:49:52,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664828977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:52,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:52,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:49:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883440380] [2024-11-13 13:49:52,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:52,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:49:52,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:52,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:49:52,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:49:52,031 INFO L87 Difference]: Start difference. First operand 283 states and 370 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:52,752 INFO L93 Difference]: Finished difference Result 593 states and 774 transitions. [2024-11-13 13:49:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:49:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:52,755 INFO L225 Difference]: With dead ends: 593 [2024-11-13 13:49:52,756 INFO L226 Difference]: Without dead ends: 313 [2024-11-13 13:49:52,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:49:52,757 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 55 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:52,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 685 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:49:52,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-13 13:49:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 277. [2024-11-13 13:49:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 244 states have (on average 1.2540983606557377) internal successors, (306), 245 states have internal predecessors, (306), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 13:49:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 362 transitions. [2024-11-13 13:49:52,778 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 362 transitions. Word has length 180 [2024-11-13 13:49:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:52,778 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 362 transitions. [2024-11-13 13:49:52,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:49:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 362 transitions. [2024-11-13 13:49:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:49:52,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:52,780 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, 1] [2024-11-13 13:49:52,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 13:49:52,781 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:52,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash 60167338, now seen corresponding path program 1 times [2024-11-13 13:49:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68731816] [2024-11-13 13:49:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:53,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:53,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68731816] [2024-11-13 13:49:53,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68731816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:53,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:49:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143676737] [2024-11-13 13:49:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:53,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:49:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:49:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:49:53,321 INFO L87 Difference]: Start difference. First operand 277 states and 362 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-11-13 13:49:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:53,682 INFO L93 Difference]: Finished difference Result 724 states and 946 transitions. [2024-11-13 13:49:53,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:49:53,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 180 [2024-11-13 13:49:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:53,685 INFO L225 Difference]: With dead ends: 724 [2024-11-13 13:49:53,685 INFO L226 Difference]: Without dead ends: 450 [2024-11-13 13:49:53,686 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-11-13 13:49:53,689 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 106 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:53,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 362 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:49:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-13 13:49:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 340. [2024-11-13 13:49:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 282 states have (on average 1.2304964539007093) internal successors, (347), 283 states have internal predecessors, (347), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-13 13:49:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 449 transitions. [2024-11-13 13:49:53,731 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 449 transitions. Word has length 180 [2024-11-13 13:49:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:53,731 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 449 transitions. [2024-11-13 13:49:53,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-11-13 13:49:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 449 transitions. [2024-11-13 13:49:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-13 13:49:53,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:53,733 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, 1, 1, 1] [2024-11-13 13:49:53,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 13:49:53,734 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:53,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash 943337148, now seen corresponding path program 1 times [2024-11-13 13:49:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923620651] [2024-11-13 13:49:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:53,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:54,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:54,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923620651] [2024-11-13 13:49:54,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923620651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:54,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:54,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:49:54,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494773470] [2024-11-13 13:49:54,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:54,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:49:54,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:54,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:49:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:49:54,026 INFO L87 Difference]: Start difference. First operand 340 states and 449 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-11-13 13:49:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:54,082 INFO L93 Difference]: Finished difference Result 620 states and 816 transitions. [2024-11-13 13:49:54,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:49:54,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 182 [2024-11-13 13:49:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:54,086 INFO L225 Difference]: With dead ends: 620 [2024-11-13 13:49:54,086 INFO L226 Difference]: Without dead ends: 346 [2024-11-13 13:49:54,087 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-11-13 13:49:54,088 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:54,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:49:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-13 13:49:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-13 13:49:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 288 states have (on average 1.2256944444444444) internal successors, (353), 289 states have internal predecessors, (353), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-13 13:49:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 455 transitions. [2024-11-13 13:49:54,120 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 455 transitions. Word has length 182 [2024-11-13 13:49:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:54,121 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 455 transitions. [2024-11-13 13:49:54,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-11-13 13:49:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 455 transitions. [2024-11-13 13:49:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 13:49:54,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:54,123 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, 1, 1, 1, 1, 1] [2024-11-13 13:49:54,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 13:49:54,123 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:54,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:54,123 INFO L85 PathProgramCache]: Analyzing trace with hash 676581847, now seen corresponding path program 1 times [2024-11-13 13:49:54,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:54,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350187339] [2024-11-13 13:49:54,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:54,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:49:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:49:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:49:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:49:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:49:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:49:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:49:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:49:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:49:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:49:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:49:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:49:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:49:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-13 13:49:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 13:49:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 13:49:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:49:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 13:49:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:49:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 13:49:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:49:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:49:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 13:49:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:49:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:49:54,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:49:54,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350187339] [2024-11-13 13:49:54,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350187339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:49:54,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:49:54,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:49:54,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759040286] [2024-11-13 13:49:54,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:49:54,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:49:54,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:49:54,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:49:54,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:49:54,701 INFO L87 Difference]: Start difference. First operand 346 states and 455 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-11-13 13:49:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:49:55,291 INFO L93 Difference]: Finished difference Result 625 states and 814 transitions. [2024-11-13 13:49:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:49:55,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 184 [2024-11-13 13:49:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:49:55,295 INFO L225 Difference]: With dead ends: 625 [2024-11-13 13:49:55,296 INFO L226 Difference]: Without dead ends: 623 [2024-11-13 13:49:55,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:49:55,298 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 95 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:49:55,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 957 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:49:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-13 13:49:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 620. [2024-11-13 13:49:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 534 states have (on average 1.2303370786516854) internal successors, (657), 537 states have internal predecessors, (657), 75 states have call successors, (75), 10 states have call predecessors, (75), 10 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-13 13:49:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 807 transitions. [2024-11-13 13:49:55,347 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 807 transitions. Word has length 184 [2024-11-13 13:49:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:49:55,347 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 807 transitions. [2024-11-13 13:49:55,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-11-13 13:49:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 807 transitions. [2024-11-13 13:49:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 13:49:55,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:49:55,350 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, 1, 1, 1, 1, 1] [2024-11-13 13:49:55,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 13:49:55,350 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:49:55,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:49:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash -167423655, now seen corresponding path program 1 times [2024-11-13 13:49:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:49:55,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477533171] [2024-11-13 13:49:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:49:55,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:49:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:49:55,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:49:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:49:55,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:49:55,646 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:49:55,647 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:49:55,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 13:49:55,652 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] [2024-11-13 13:49:55,735 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:49:55,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:49:55 BoogieIcfgContainer [2024-11-13 13:49:55,740 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:49:55,741 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:49:55,741 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:49:55,741 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:49:55,742 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:49:22" (3/4) ... [2024-11-13 13:49:55,745 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:49:55,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:49:55,748 INFO L158 Benchmark]: Toolchain (without parser) took 34722.63ms. Allocated memory was 109.1MB in the beginning and 671.1MB in the end (delta: 562.0MB). Free memory was 83.2MB in the beginning and 601.0MB in the end (delta: -517.8MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-13 13:49:55,748 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 83.9MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:49:55,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.84ms. Allocated memory is still 109.1MB. Free memory was 83.2MB in the beginning and 66.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:49:55,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.87ms. Allocated memory is still 109.1MB. Free memory was 66.9MB in the beginning and 63.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:49:55,750 INFO L158 Benchmark]: Boogie Preprocessor took 76.32ms. Allocated memory is still 109.1MB. Free memory was 63.4MB in the beginning and 60.3MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:49:55,751 INFO L158 Benchmark]: RCFGBuilder took 1217.49ms. Allocated memory is still 109.1MB. Free memory was 60.3MB in the beginning and 74.5MB in the end (delta: -14.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-13 13:49:55,754 INFO L158 Benchmark]: TraceAbstraction took 32951.12ms. Allocated memory was 109.1MB in the beginning and 671.1MB in the end (delta: 562.0MB). Free memory was 74.5MB in the beginning and 601.0MB in the end (delta: -526.5MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-11-13 13:49:55,754 INFO L158 Benchmark]: Witness Printer took 5.75ms. Allocated memory is still 671.1MB. Free memory was 601.0MB in the beginning and 601.0MB in the end (delta: 61.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:49:55,755 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 83.9MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.84ms. Allocated memory is still 109.1MB. Free memory was 83.2MB in the beginning and 66.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.87ms. Allocated memory is still 109.1MB. Free memory was 66.9MB in the beginning and 63.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.32ms. Allocated memory is still 109.1MB. Free memory was 63.4MB in the beginning and 60.3MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1217.49ms. Allocated memory is still 109.1MB. Free memory was 60.3MB in the beginning and 74.5MB in the end (delta: -14.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 32951.12ms. Allocated memory was 109.1MB in the beginning and 671.1MB in the end (delta: 562.0MB). Free memory was 74.5MB in the beginning and 601.0MB in the end (delta: -526.5MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * Witness Printer took 5.75ms. Allocated memory is still 671.1MB. Free memory was 601.0MB in the beginning and 601.0MB in the end (delta: 61.5kB). Peak memory consumption was 8.4MB. 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 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L59] unsigned char last_1_WrapperStruct00_var_1_5 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_5=0] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L124] EXPR WrapperStruct00.var_1_5 [L124] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L87] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L93] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_4 [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_4 [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L98] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L101] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L135] RET updateVariables() [L136] CALL step() [L63] COND FALSE !(\read(last_1_WrapperStruct00_var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L68] EXPR WrapperStruct00.var_1_1 [L68] EXPR WrapperStruct00.var_1_4 [L68] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L68] COND FALSE !(WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) [L71] EXPR WrapperStruct00.var_1_3 [L71] WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L71] COND TRUE WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) [L72] EXPR WrapperStruct00.var_1_2 [L72] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] WrapperStruct00.var_1_5 = ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7) [L76] EXPR WrapperStruct00.var_1_11 [L76] EXPR WrapperStruct00.var_1_12 [L76] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L76] EXPR ((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1) [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR ((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L76] signed long int stepLocal_1 = (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1))); [L77] EXPR WrapperStruct00.var_1_17 [L77] signed char stepLocal_0 = WrapperStruct00.var_1_17; [L78] COND FALSE !(-10 >= stepLocal_0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0, stepLocal_1=255] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) [L127] EXPR WrapperStruct00.var_1_3 [L127] EXPR WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))) [L127] EXPR WrapperStruct00.var_1_5 [L127] EXPR WrapperStruct00.var_1_2 [L127] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) [L127] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) [L127] EXPR WrapperStruct00.var_1_1 [L127] EXPR WrapperStruct00.var_1_4 [L127] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1 [L127] EXPR WrapperStruct00.var_1_17 [L127] EXPR WrapperStruct00.var_1_15 [L127] EXPR (WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127-L128] return (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.8s, OverallIterations: 23, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1458 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1452 mSDsluCounter, 12427 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8937 mSDsCounter, 426 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4121 IncrementalHoareTripleChecker+Invalid, 4547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 426 mSolverCounterUnsat, 3490 mSDtfsCounter, 4121 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1271 GetRequests, 1159 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=620occurred in iteration=22, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 682 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 4108 NumberOfCodeBlocks, 4108 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3902 ConstructedInterpolants, 0 QuantifiedInterpolants, 6790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 22264/22264 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 13:49:55,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd --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 c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:49:58,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:49:58,652 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:49:58,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:49:58,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:49:58,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:49:58,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:49:58,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:49:58,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:49:58,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:49:58,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:49:58,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:49:58,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:49:58,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:49:58,708 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:49:58,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:49:58,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:49:58,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:49:58,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:49:58,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:49:58,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:49:58,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:49:58,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:49:58,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:49:58,711 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:49:58,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:49:58,712 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:49:58,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:49:58,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:49:58,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:49:58,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:49:58,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:49:58,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:49:58,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:49:58,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:49:58,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:49:58,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:49:58,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:49:58,715 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:49:58,715 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:49:58,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:49:58,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:49:58,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:49:58,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:49:58,716 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd 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 -> c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f [2024-11-13 13:49:59,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:49:59,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:49:59,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:49:59,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:49:59,106 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:49:59,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i Unable to find full path for "g++" [2024-11-13 13:50:01,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:50:01,487 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:50:01,492 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2024-11-13 13:50:01,505 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/data/6b760d1bf/f7aa536fd8884358a3be1e958322d8f3/FLAG8cd7e5b3c [2024-11-13 13:50:01,523 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/data/6b760d1bf/f7aa536fd8884358a3be1e958322d8f3 [2024-11-13 13:50:01,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:50:01,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:50:01,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:50:01,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:50:01,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:50:01,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:50:01" (1/1) ... [2024-11-13 13:50:01,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19091281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:01, skipping insertion in model container [2024-11-13 13:50:01,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:50:01" (1/1) ... [2024-11-13 13:50:01,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:50:01,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2024-11-13 13:50:01,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:50:01,884 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:50:01,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2024-11-13 13:50:01,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:50:02,023 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:50:02,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02 WrapperNode [2024-11-13 13:50:02,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:50:02,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:50:02,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:50:02,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:50:02,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,131 INFO L138 Inliner]: procedures = 31, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2024-11-13 13:50:02,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:50:02,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:50:02,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:50:02,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:50:02,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,209 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2024-11-13 13:50:02,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:50:02,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:50:02,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:50:02,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:50:02,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (1/1) ... [2024-11-13 13:50:02,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:50:02,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:50:02,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:50:02,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:50:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:50:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 13:50:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 13:50:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-13 13:50:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-13 13:50:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 13:50:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 13:50:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 13:50:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 13:50:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:50:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 13:50:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-13 13:50:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-13 13:50:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:50:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:50:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:50:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:50:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 13:50:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 13:50:02,546 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:50:02,548 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:50:17,269 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-13 13:50:17,269 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:50:17,291 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:50:17,293 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:50:17,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:50:17 BoogieIcfgContainer [2024-11-13 13:50:17,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:50:17,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:50:17,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:50:17,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:50:17,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:50:01" (1/3) ... [2024-11-13 13:50:17,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35640540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:50:17, skipping insertion in model container [2024-11-13 13:50:17,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:50:02" (2/3) ... [2024-11-13 13:50:17,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35640540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:50:17, skipping insertion in model container [2024-11-13 13:50:17,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:50:17" (3/3) ... [2024-11-13 13:50:17,309 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-34.i [2024-11-13 13:50:17,327 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:50:17,329 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-34.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:50:17,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:50:17,412 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;@3915f7bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:50:17,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:50:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 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-11-13 13:50:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 13:50:17,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:17,444 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-11-13 13:50:17,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:17,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1838312212, now seen corresponding path program 1 times [2024-11-13 13:50:17,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:50:17,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420287959] [2024-11-13 13:50:17,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:17,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:17,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:50:17,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:50:17,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 13:50:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:18,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 13:50:18,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:50:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-11-13 13:50:18,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:50:18,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:50:18,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420287959] [2024-11-13 13:50:18,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420287959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:18,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:18,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:50:18,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415254640] [2024-11-13 13:50:18,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:18,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:50:18,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:50:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:50:18,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:50:18,221 INFO L87 Difference]: Start difference. First operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 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 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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-11-13 13:50:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:50:18,267 INFO L93 Difference]: Finished difference Result 233 states and 367 transitions. [2024-11-13 13:50:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:50:18,270 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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 171 [2024-11-13 13:50:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:50:18,278 INFO L225 Difference]: With dead ends: 233 [2024-11-13 13:50:18,279 INFO L226 Difference]: Without dead ends: 116 [2024-11-13 13:50:18,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:50:18,286 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:50:18,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:50:18,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-13 13:50:18,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-13 13:50:18,341 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-11-13 13:50:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-13 13:50:18,349 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2024-11-13 13:50:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:50:18,349 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-13 13:50:18,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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-11-13 13:50:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-13 13:50:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 13:50:18,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:18,354 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-11-13 13:50:18,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-13 13:50:18,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:18,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:18,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash -504854606, now seen corresponding path program 1 times [2024-11-13 13:50:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:50:18,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163460231] [2024-11-13 13:50:18,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:18,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:50:18,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:50:18,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 13:50:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:19,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:50:19,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:50:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:50:19,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:50:19,233 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:50:19,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163460231] [2024-11-13 13:50:19,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163460231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:19,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:19,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:50:19,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362483743] [2024-11-13 13:50:19,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:19,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:50:19,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:50:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:50:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:50:19,237 INFO L87 Difference]: Start difference. First operand 116 states and 168 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-11-13 13:50:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:50:19,304 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2024-11-13 13:50:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:50:19,308 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-11-13 13:50:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:50:19,311 INFO L225 Difference]: With dead ends: 227 [2024-11-13 13:50:19,311 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 13:50:19,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:50:19,318 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:50:19,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:50:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 13:50:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-13 13:50:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 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-11-13 13:50:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-13 13:50:19,331 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 171 [2024-11-13 13:50:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:50:19,333 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-13 13:50:19,334 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-11-13 13:50:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-13 13:50:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 13:50:19,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:19,337 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-11-13 13:50:19,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 13:50:19,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:19,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:19,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1528303270, now seen corresponding path program 1 times [2024-11-13 13:50:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:50:19,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804347062] [2024-11-13 13:50:19,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:19,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:19,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:50:19,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:50:19,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 13:50:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:20,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:50:20,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:50:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:50:20,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:50:20,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:50:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804347062] [2024-11-13 13:50:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804347062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:20,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:20,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:50:20,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341828744] [2024-11-13 13:50:20,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:20,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:50:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:50:20,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:50:20,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:50:20,260 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (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-11-13 13:50:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:50:20,359 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2024-11-13 13:50:20,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:50:20,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (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-11-13 13:50:20,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:50:20,362 INFO L225 Difference]: With dead ends: 227 [2024-11-13 13:50:20,362 INFO L226 Difference]: Without dead ends: 116 [2024-11-13 13:50:20,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:50:20,364 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:50:20,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:50:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-13 13:50:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-13 13:50:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 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-11-13 13:50:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-13 13:50:20,380 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 173 [2024-11-13 13:50:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:50:20,381 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-13 13:50:20,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (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-11-13 13:50:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-13 13:50:20,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 13:50:20,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:20,388 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-11-13 13:50:20,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 13:50:20,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:20,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:20,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash 737466904, now seen corresponding path program 1 times [2024-11-13 13:50:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:50:20,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751812314] [2024-11-13 13:50:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:20,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:20,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:50:20,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:50:20,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 13:50:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:21,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:50:21,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:50:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:50:21,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:50:21,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:50:21,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751812314] [2024-11-13 13:50:21,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751812314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:21,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:21,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:50:21,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776793359] [2024-11-13 13:50:21,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:21,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:50:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:50:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:50:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:50:21,128 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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-11-13 13:50:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:50:21,316 INFO L93 Difference]: Finished difference Result 273 states and 392 transitions. [2024-11-13 13:50:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:50:21,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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-11-13 13:50:21,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:50:21,319 INFO L225 Difference]: With dead ends: 273 [2024-11-13 13:50:21,319 INFO L226 Difference]: Without dead ends: 160 [2024-11-13 13:50:21,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:50:21,321 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 72 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:50:21,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 345 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:50:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-13 13:50:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2024-11-13 13:50:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 107 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-11-13 13:50:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 187 transitions. [2024-11-13 13:50:21,341 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 187 transitions. Word has length 175 [2024-11-13 13:50:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:50:21,343 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 187 transitions. [2024-11-13 13:50:21,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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-11-13 13:50:21,343 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 187 transitions. [2024-11-13 13:50:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 13:50:21,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:21,346 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-11-13 13:50:21,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-13 13:50:21,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:21,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:21,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:21,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1397398595, now seen corresponding path program 1 times [2024-11-13 13:50:21,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:50:21,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783409288] [2024-11-13 13:50:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:21,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:21,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:50:21,551 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:50:21,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 13:50:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:22,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:50:22,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:50:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:50:22,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:50:22,317 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:50:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783409288] [2024-11-13 13:50:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783409288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:22,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:22,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:50:22,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244141692] [2024-11-13 13:50:22,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:22,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:50:22,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:50:22,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:50:22,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:50:22,321 INFO L87 Difference]: Start difference. First operand 132 states and 187 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-11-13 13:50:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:50:22,383 INFO L93 Difference]: Finished difference Result 289 states and 410 transitions. [2024-11-13 13:50:22,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:50:22,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-11-13 13:50:22,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:50:22,386 INFO L225 Difference]: With dead ends: 289 [2024-11-13 13:50:22,386 INFO L226 Difference]: Without dead ends: 160 [2024-11-13 13:50:22,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:50:22,391 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 51 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:50:22,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 313 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:50:22,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-13 13:50:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2024-11-13 13:50:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.308411214953271) internal successors, (140), 107 states have internal predecessors, (140), 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-11-13 13:50:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 186 transitions. [2024-11-13 13:50:22,417 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 186 transitions. Word has length 177 [2024-11-13 13:50:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:50:22,417 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 186 transitions. [2024-11-13 13:50:22,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-11-13 13:50:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 186 transitions. [2024-11-13 13:50:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-13 13:50:22,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:22,424 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] [2024-11-13 13:50:22,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-13 13:50:22,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:22,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:22,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2008072577, now seen corresponding path program 1 times [2024-11-13 13:50:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:50:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113046962] [2024-11-13 13:50:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:22,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:22,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:50:22,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:50:22,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 13:50:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:23,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:50:23,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:50:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:50:23,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:50:23,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:50:23,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113046962] [2024-11-13 13:50:23,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113046962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:23,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:23,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:50:23,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562132972] [2024-11-13 13:50:23,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:23,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:50:23,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:50:23,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:50:23,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:50:23,195 INFO L87 Difference]: Start difference. First operand 132 states and 186 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (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-11-13 13:50:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:50:23,238 INFO L93 Difference]: Finished difference Result 259 states and 366 transitions. [2024-11-13 13:50:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:50:23,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (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 178 [2024-11-13 13:50:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:50:23,241 INFO L225 Difference]: With dead ends: 259 [2024-11-13 13:50:23,241 INFO L226 Difference]: Without dead ends: 130 [2024-11-13 13:50:23,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:50:23,243 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:50:23,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:50:23,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-13 13:50:23,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-13 13:50:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 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-11-13 13:50:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2024-11-13 13:50:23,254 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 178 [2024-11-13 13:50:23,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:50:23,255 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2024-11-13 13:50:23,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (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-11-13 13:50:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2024-11-13 13:50:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:50:23,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:23,258 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, 1] [2024-11-13 13:50:23,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:50:23,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:23,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:23,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1833079883, now seen corresponding path program 1 times [2024-11-13 13:50:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:50:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171788118] [2024-11-13 13:50:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:23,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:23,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:50:23,462 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:50:23,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-13 13:50:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:23,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 13:50:23,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:50:24,106 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-11-13 13:50:24,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:50:24,659 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 32 treesize of output 14 [2024-11-13 13:50:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:50:25,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:50:25,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:50:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171788118] [2024-11-13 13:50:25,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171788118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:25,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:25,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 13:50:25,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131052999] [2024-11-13 13:50:25,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:25,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 13:50:25,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:50:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:50:25,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:50:25,094 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-11-13 13:50:28,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:35,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:39,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:44,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:48,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:52,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:56,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:50:57,538 INFO L93 Difference]: Finished difference Result 430 states and 599 transitions. [2024-11-13 13:50:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:50:57,539 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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 180 [2024-11-13 13:50:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:50:57,541 INFO L225 Difference]: With dead ends: 430 [2024-11-13 13:50:57,541 INFO L226 Difference]: Without dead ends: 303 [2024-11-13 13:50:57,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-11-13 13:50:57,543 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 187 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:50:57,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1834 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1095 Invalid, 2 Unknown, 0 Unchecked, 31.7s Time] [2024-11-13 13:50:57,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-13 13:50:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 190. [2024-11-13 13:50:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 163 states have internal predecessors, (209), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:50:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 259 transitions. [2024-11-13 13:50:57,566 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 259 transitions. Word has length 180 [2024-11-13 13:50:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:50:57,567 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 259 transitions. [2024-11-13 13:50:57,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-11-13 13:50:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 259 transitions. [2024-11-13 13:50:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:50:57,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:57,571 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, 1] [2024-11-13 13:50:57,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-13 13:50:57,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:57,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:57,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:57,772 INFO L85 PathProgramCache]: Analyzing trace with hash 553216205, now seen corresponding path program 1 times [2024-11-13 13:50:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:50:57,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251789638] [2024-11-13 13:50:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:50:57,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:50:57,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:50:57,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:50:57,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-13 13:50:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:50:58,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 13:50:58,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:50:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:50:58,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:50:58,671 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:50:58,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251789638] [2024-11-13 13:50:58,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251789638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:50:58,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:50:58,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:50:58,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489961406] [2024-11-13 13:50:58,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:50:58,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:50:58,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:50:58,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:50:58,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:50:58,674 INFO L87 Difference]: Start difference. First operand 190 states and 259 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:51:03,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:51:06,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:51:10,921 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-11-13 13:51:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:51:11,114 INFO L93 Difference]: Finished difference Result 413 states and 561 transitions. [2024-11-13 13:51:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:51:11,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 180 [2024-11-13 13:51:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:51:11,121 INFO L225 Difference]: With dead ends: 413 [2024-11-13 13:51:11,121 INFO L226 Difference]: Without dead ends: 226 [2024-11-13 13:51:11,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:51:11,123 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 43 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:51:11,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 688 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 12.4s Time] [2024-11-13 13:51:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-13 13:51:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 200. [2024-11-13 13:51:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 172 states have (on average 1.2906976744186047) internal successors, (222), 173 states have internal predecessors, (222), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:51:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 272 transitions. [2024-11-13 13:51:11,149 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 272 transitions. Word has length 180 [2024-11-13 13:51:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:51:11,149 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 272 transitions. [2024-11-13 13:51:11,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:51:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 272 transitions. [2024-11-13 13:51:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:51:11,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:51:11,153 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, 1] [2024-11-13 13:51:11,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-13 13:51:11,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:51:11,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:51:11,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:51:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1254280783, now seen corresponding path program 1 times [2024-11-13 13:51:11,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:51:11,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295682245] [2024-11-13 13:51:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:51:11,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:51:11,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:51:11,357 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:51:11,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-13 13:51:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:51:11,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 13:51:11,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:51:11,998 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-11-13 13:51:12,463 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 52 treesize of output 19 [2024-11-13 13:51:12,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-13 13:51:13,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:13,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2024-11-13 13:51:13,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:13,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-13 13:51:14,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:14,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-11-13 13:51:15,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:15,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2024-11-13 13:51:16,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:16,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2024-11-13 13:51:17,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:17,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76 [2024-11-13 13:51:17,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:17,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 79 [2024-11-13 13:51:18,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:18,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 89 [2024-11-13 13:51:20,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:20,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 92 [2024-11-13 13:51:21,591 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 122 treesize of output 94 [2024-11-13 13:51:21,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:51:21,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:21,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 176 [2024-11-13 13:51:21,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:51:21,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 78 [2024-11-13 13:51:24,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:24,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 215 treesize of output 107 [2024-11-13 13:51:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 866 proven. 57 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-13 13:51:24,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:51:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:51:25,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:51:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295682245] [2024-11-13 13:51:25,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295682245] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 13:51:25,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:51:25,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 19 [2024-11-13 13:51:25,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092785156] [2024-11-13 13:51:25,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:51:25,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:51:25,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:51:25,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:51:25,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:51:25,612 INFO L87 Difference]: Start difference. First operand 200 states and 272 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-11-13 13:51:27,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:51:30,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:51:32,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:51:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:51:32,357 INFO L93 Difference]: Finished difference Result 524 states and 707 transitions. [2024-11-13 13:51:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:51:32,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 180 [2024-11-13 13:51:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:51:32,363 INFO L225 Difference]: With dead ends: 524 [2024-11-13 13:51:32,363 INFO L226 Difference]: Without dead ends: 327 [2024-11-13 13:51:32,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:51:32,369 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 57 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:51:32,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 432 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-13 13:51:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-13 13:51:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 264. [2024-11-13 13:51:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 237 states have internal predecessors, (307), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:51:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 357 transitions. [2024-11-13 13:51:32,387 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 357 transitions. Word has length 180 [2024-11-13 13:51:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:51:32,387 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 357 transitions. [2024-11-13 13:51:32,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-11-13 13:51:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 357 transitions. [2024-11-13 13:51:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:51:32,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:51:32,391 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, 1] [2024-11-13 13:51:32,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-13 13:51:32,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:51:32,592 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:51:32,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:51:32,593 INFO L85 PathProgramCache]: Analyzing trace with hash -398110769, now seen corresponding path program 1 times [2024-11-13 13:51:32,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:51:32,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152718195] [2024-11-13 13:51:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:51:32,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:51:32,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:51:32,596 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:51:32,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-13 13:51:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:51:33,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 13:51:33,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:51:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:51:33,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:51:33,403 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:51:33,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152718195] [2024-11-13 13:51:33,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152718195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:51:33,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:51:33,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:51:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808838826] [2024-11-13 13:51:33,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:51:33,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:51:33,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:51:33,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:51:33,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:51:33,405 INFO L87 Difference]: Start difference. First operand 264 states and 357 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:51:38,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:51:40,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:51:42,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:51:42,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:51:42,281 INFO L93 Difference]: Finished difference Result 534 states and 719 transitions. [2024-11-13 13:51:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:51:42,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 180 [2024-11-13 13:51:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:51:42,285 INFO L225 Difference]: With dead ends: 534 [2024-11-13 13:51:42,285 INFO L226 Difference]: Without dead ends: 273 [2024-11-13 13:51:42,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 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-11-13 13:51:42,289 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 66 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:51:42,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 603 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 230 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2024-11-13 13:51:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-13 13:51:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 233. [2024-11-13 13:51:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 205 states have (on average 1.2926829268292683) internal successors, (265), 206 states have internal predecessors, (265), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:51:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 315 transitions. [2024-11-13 13:51:42,308 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 315 transitions. Word has length 180 [2024-11-13 13:51:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:51:42,309 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 315 transitions. [2024-11-13 13:51:42,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:51:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 315 transitions. [2024-11-13 13:51:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:51:42,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:51:42,313 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, 1] [2024-11-13 13:51:42,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-13 13:51:42,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:51:42,514 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:51:42,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:51:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1654483119, now seen corresponding path program 1 times [2024-11-13 13:51:42,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:51:42,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682491760] [2024-11-13 13:51:42,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:51:42,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:51:42,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:51:42,517 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:51:42,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:51:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:51:43,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 13:51:43,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:51:43,189 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-11-13 13:51:43,363 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-11-13 13:51:43,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:43,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 28 [2024-11-13 13:51:43,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:43,876 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 36 treesize of output 38 [2024-11-13 13:51:44,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:44,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-11-13 13:51:44,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:44,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2024-11-13 13:51:45,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:45,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 77 [2024-11-13 13:51:46,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:46,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2024-11-13 13:51:47,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:47,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2024-11-13 13:51:47,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:47,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2024-11-13 13:51:48,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:48,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 90 [2024-11-13 13:51:49,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:49,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 103 [2024-11-13 13:51:51,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:51,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 106 [2024-11-13 13:51:52,216 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 133 treesize of output 103 [2024-11-13 13:51:52,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:51:52,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:52,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 103 treesize of output 195 [2024-11-13 13:51:52,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 95 [2024-11-13 13:51:54,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:51:54,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 235 treesize of output 103 [2024-11-13 13:51:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 804 proven. 63 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 13:51:54,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:51:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:51:55,569 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:51:55,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682491760] [2024-11-13 13:51:55,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682491760] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 13:51:55,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:51:55,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 19 [2024-11-13 13:51:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997310201] [2024-11-13 13:51:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:51:55,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:51:55,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:51:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:51:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:51:55,571 INFO L87 Difference]: Start difference. First operand 233 states and 315 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-11-13 13:51:59,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:52:04,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:52:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:52:05,122 INFO L93 Difference]: Finished difference Result 571 states and 768 transitions. [2024-11-13 13:52:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:52:05,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 180 [2024-11-13 13:52:05,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:52:05,127 INFO L225 Difference]: With dead ends: 571 [2024-11-13 13:52:05,128 INFO L226 Difference]: Without dead ends: 341 [2024-11-13 13:52:05,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:52:05,130 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 89 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:52:05,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 346 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2024-11-13 13:52:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-13 13:52:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 291. [2024-11-13 13:52:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 263 states have (on average 1.2927756653992395) internal successors, (340), 264 states have internal predecessors, (340), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:52:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 390 transitions. [2024-11-13 13:52:05,165 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 390 transitions. Word has length 180 [2024-11-13 13:52:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:52:05,166 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 390 transitions. [2024-11-13 13:52:05,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-11-13 13:52:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 390 transitions. [2024-11-13 13:52:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:52:05,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:52:05,173 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, 1] [2024-11-13 13:52:05,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-13 13:52:05,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:52:05,374 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:52:05,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:52:05,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1768741683, now seen corresponding path program 1 times [2024-11-13 13:52:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:52:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144731343] [2024-11-13 13:52:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:52:05,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:52:05,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:52:05,377 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:52:05,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:52:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:52:05,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:52:05,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:52:06,056 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-11-13 13:52:06,203 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-11-13 13:52:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:52:06,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:52:06,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:52:06,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144731343] [2024-11-13 13:52:06,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144731343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:52:06,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:52:06,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 13:52:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843641859] [2024-11-13 13:52:06,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:52:06,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:52:06,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:52:06,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:52:06,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:52:06,637 INFO L87 Difference]: Start difference. First operand 291 states and 390 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-11-13 13:52:11,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:52:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:52:15,352 INFO L93 Difference]: Finished difference Result 740 states and 992 transitions. [2024-11-13 13:52:15,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:52:15,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 180 [2024-11-13 13:52:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:52:15,356 INFO L225 Difference]: With dead ends: 740 [2024-11-13 13:52:15,356 INFO L226 Difference]: Without dead ends: 452 [2024-11-13 13:52:15,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:52:15,358 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 141 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:52:15,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1394 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 590 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2024-11-13 13:52:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-13 13:52:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 291. [2024-11-13 13:52:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 263 states have (on average 1.296577946768061) internal successors, (341), 264 states have internal predecessors, (341), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 13:52:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 391 transitions. [2024-11-13 13:52:15,377 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 391 transitions. Word has length 180 [2024-11-13 13:52:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:52:15,378 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 391 transitions. [2024-11-13 13:52:15,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-11-13 13:52:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 391 transitions. [2024-11-13 13:52:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:52:15,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:52:15,380 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, 1] [2024-11-13 13:52:15,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:52:15,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:52:15,581 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:52:15,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:52:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash 268744915, now seen corresponding path program 1 times [2024-11-13 13:52:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:52:15,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664995944] [2024-11-13 13:52:15,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:52:15,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:52:15,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:52:15,584 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:52:15,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:52:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:52:16,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 13:52:16,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:52:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:52:16,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:52:16,202 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:52:16,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664995944] [2024-11-13 13:52:16,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664995944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:52:16,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:52:16,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:52:16,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715432349] [2024-11-13 13:52:16,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:52:16,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:52:16,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:52:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:52:16,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:52:16,204 INFO L87 Difference]: Start difference. First operand 291 states and 391 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:52:20,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:52:24,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:52:29,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:52:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:52:29,296 INFO L93 Difference]: Finished difference Result 592 states and 788 transitions. [2024-11-13 13:52:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:52:29,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 180 [2024-11-13 13:52:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:52:29,299 INFO L225 Difference]: With dead ends: 592 [2024-11-13 13:52:29,299 INFO L226 Difference]: Without dead ends: 304 [2024-11-13 13:52:29,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:52:29,301 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 66 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:52:29,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 736 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 270 Invalid, 1 Unknown, 0 Unchecked, 13.0s Time] [2024-11-13 13:52:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-13 13:52:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 239. [2024-11-13 13:52:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 213 states have (on average 1.272300469483568) internal successors, (271), 213 states have internal predecessors, (271), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 13:52:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 317 transitions. [2024-11-13 13:52:29,314 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 317 transitions. Word has length 180 [2024-11-13 13:52:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:52:29,314 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 317 transitions. [2024-11-13 13:52:29,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-11-13 13:52:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 317 transitions. [2024-11-13 13:52:29,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:52:29,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:52:29,316 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, 1] [2024-11-13 13:52:29,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:52:29,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:52:29,517 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:52:29,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:52:29,519 INFO L85 PathProgramCache]: Analyzing trace with hash 988092625, now seen corresponding path program 1 times [2024-11-13 13:52:29,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:52:29,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526064995] [2024-11-13 13:52:29,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:52:29,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:52:29,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:52:29,522 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:52:29,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:52:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:52:30,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 13:52:30,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:52:30,239 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-11-13 13:52:30,536 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 47 treesize of output 29 [2024-11-13 13:52:34,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:34,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-13 13:52:35,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:35,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-11-13 13:52:35,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:35,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-11-13 13:52:36,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:36,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2024-11-13 13:52:37,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:37,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2024-11-13 13:52:37,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:37,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76 [2024-11-13 13:52:38,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:38,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 79 [2024-11-13 13:52:39,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:39,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 79 [2024-11-13 13:52:40,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:40,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 89 [2024-11-13 13:52:41,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:41,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 92 [2024-11-13 13:52:42,598 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 121 treesize of output 93 [2024-11-13 13:52:42,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:52:42,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:42,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 93 treesize of output 175 [2024-11-13 13:52:42,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 96 [2024-11-13 13:52:44,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:44,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 201 treesize of output 93 [2024-11-13 13:52:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 842 proven. 57 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-13 13:52:44,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:52:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:52:45,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:52:45,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526064995] [2024-11-13 13:52:45,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526064995] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 13:52:45,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:52:45,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 19 [2024-11-13 13:52:45,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427365482] [2024-11-13 13:52:45,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:52:45,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:52:45,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:52:45,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:52:45,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=244, Unknown=1, NotChecked=0, Total=342 [2024-11-13 13:52:45,491 INFO L87 Difference]: Start difference. First operand 239 states and 317 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-11-13 13:52:49,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:52:51,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:52:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:52:51,462 INFO L93 Difference]: Finished difference Result 509 states and 671 transitions. [2024-11-13 13:52:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:52:51,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 180 [2024-11-13 13:52:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:52:51,465 INFO L225 Difference]: With dead ends: 509 [2024-11-13 13:52:51,465 INFO L226 Difference]: Without dead ends: 273 [2024-11-13 13:52:51,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=102, Invalid=277, Unknown=1, NotChecked=0, Total=380 [2024-11-13 13:52:51,468 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 105 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:52:51,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 444 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-13 13:52:51,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-13 13:52:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 237. [2024-11-13 13:52:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 211 states have (on average 1.2606635071090047) internal successors, (266), 211 states have internal predecessors, (266), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 13:52:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 312 transitions. [2024-11-13 13:52:51,487 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 312 transitions. Word has length 180 [2024-11-13 13:52:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:52:51,488 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 312 transitions. [2024-11-13 13:52:51,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-11-13 13:52:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 312 transitions. [2024-11-13 13:52:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:52:51,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:52:51,493 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, 1] [2024-11-13 13:52:51,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:52:51,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:52:51,694 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:52:51,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:52:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash 409293525, now seen corresponding path program 1 times [2024-11-13 13:52:51,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:52:51,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807381607] [2024-11-13 13:52:51,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:52:51,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:52:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:52:51,697 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:52:51,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:52:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:52:52,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 13:52:52,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:52:52,515 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-11-13 13:52:53,032 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-11-13 13:52:53,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:53,507 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-11-13 13:52:54,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:54,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-11-13 13:52:54,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:54,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-11-13 13:52:55,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:55,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-11-13 13:52:56,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:56,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-11-13 13:52:56,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:56,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 69 [2024-11-13 13:52:57,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:57,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 72 [2024-11-13 13:52:58,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:58,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 72 [2024-11-13 13:52:59,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:52:59,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 82 [2024-11-13 13:53:00,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:00,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 110 treesize of output 50 [2024-11-13 13:53:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 727 proven. 96 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-13 13:53:01,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:53:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:53:03,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:53:03,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807381607] [2024-11-13 13:53:03,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807381607] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 13:53:03,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:53:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 26 [2024-11-13 13:53:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443842446] [2024-11-13 13:53:03,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:53:03,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:53:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:53:03,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:53:03,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2024-11-13 13:53:03,034 INFO L87 Difference]: Start difference. First operand 237 states and 312 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-11-13 13:53:06,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:53:12,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:53:16,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:53:20,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:53:23,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:53:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:53:23,799 INFO L93 Difference]: Finished difference Result 518 states and 681 transitions. [2024-11-13 13:53:23,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:53:23,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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 180 [2024-11-13 13:53:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:53:23,802 INFO L225 Difference]: With dead ends: 518 [2024-11-13 13:53:23,802 INFO L226 Difference]: Without dead ends: 284 [2024-11-13 13:53:23,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2024-11-13 13:53:23,805 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 72 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:53:23,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1232 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 492 Invalid, 3 Unknown, 0 Unchecked, 20.0s Time] [2024-11-13 13:53:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-13 13:53:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2024-11-13 13:53:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 248 states have (on average 1.2620967741935485) internal successors, (313), 249 states have internal predecessors, (313), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 13:53:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 369 transitions. [2024-11-13 13:53:23,821 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 369 transitions. Word has length 180 [2024-11-13 13:53:23,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:53:23,822 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 369 transitions. [2024-11-13 13:53:23,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-11-13 13:53:23,822 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 369 transitions. [2024-11-13 13:53:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:53:23,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:53:23,830 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, 1] [2024-11-13 13:53:23,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:53:24,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:53:24,031 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:53:24,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:53:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash 295034961, now seen corresponding path program 1 times [2024-11-13 13:53:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:53:24,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775699506] [2024-11-13 13:53:24,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:53:24,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:53:24,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:53:24,038 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:53:24,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:53:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:53:24,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 13:53:24,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:53:24,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:53:24,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-13 13:53:25,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2024-11-13 13:53:29,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:29,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-11-13 13:53:30,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:30,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-11-13 13:53:30,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:30,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-11-13 13:53:31,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:31,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-11-13 13:53:31,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:31,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-11-13 13:53:32,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:32,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-11-13 13:53:32,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:32,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2024-11-13 13:53:33,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:33,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 77 [2024-11-13 13:53:34,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:34,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 90 [2024-11-13 13:53:35,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:35,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 91 treesize of output 93 [2024-11-13 13:53:37,063 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 111 treesize of output 85 [2024-11-13 13:53:37,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:53:37,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:37,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 171 [2024-11-13 13:53:37,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2024-11-13 13:53:39,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:53:39,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 191 treesize of output 83 [2024-11-13 13:53:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 668 proven. 63 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-11-13 13:53:39,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:53:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:53:44,457 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:53:44,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775699506] [2024-11-13 13:53:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775699506] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 13:53:44,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:53:44,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 17 [2024-11-13 13:53:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922792179] [2024-11-13 13:53:44,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:53:44,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:53:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:53:44,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:53:44,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=198, Unknown=2, NotChecked=0, Total=272 [2024-11-13 13:53:44,460 INFO L87 Difference]: Start difference. First operand 281 states and 369 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-11-13 13:53:49,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:53:57,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:54:01,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:54:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:54:01,298 INFO L93 Difference]: Finished difference Result 581 states and 762 transitions. [2024-11-13 13:54:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:54:01,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 180 [2024-11-13 13:54:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:54:01,301 INFO L225 Difference]: With dead ends: 581 [2024-11-13 13:54:01,301 INFO L226 Difference]: Without dead ends: 303 [2024-11-13 13:54:01,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=78, Invalid=225, Unknown=3, NotChecked=0, Total=306 [2024-11-13 13:54:01,302 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 87 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:54:01,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 450 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 1 Unknown, 0 Unchecked, 12.8s Time] [2024-11-13 13:54:01,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-13 13:54:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 277. [2024-11-13 13:54:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 244 states have (on average 1.2540983606557377) internal successors, (306), 245 states have internal predecessors, (306), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 13:54:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 362 transitions. [2024-11-13 13:54:01,319 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 362 transitions. Word has length 180 [2024-11-13 13:54:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:54:01,319 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 362 transitions. [2024-11-13 13:54:01,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-11-13 13:54:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 362 transitions. [2024-11-13 13:54:01,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-13 13:54:01,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:54:01,322 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, 1] [2024-11-13 13:54:01,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-13 13:54:01,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:54:01,522 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:54:01,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:54:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2098486594, now seen corresponding path program 1 times [2024-11-13 13:54:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:54:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690978082] [2024-11-13 13:54:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:54:01,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:54:01,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:54:01,526 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:54:01,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:54:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:54:02,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:54:02,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:54:02,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:54:02,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:54:02,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:54:02,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:54:02,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:54:02,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:54:02,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 61 [2024-11-13 13:54:02,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:54:02,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 71 treesize of output 29 [2024-11-13 13:54:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:54:03,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:54:03,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:54:03,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690978082] [2024-11-13 13:54:03,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690978082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:54:03,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:54:03,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:54:03,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163401416] [2024-11-13 13:54:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:54:03,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:54:03,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:54:03,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:54:03,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:54:03,701 INFO L87 Difference]: Start difference. First operand 277 states and 362 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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-11-13 13:54:08,277 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-11-13 13:54:10,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:54:15,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:54:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:54:15,253 INFO L93 Difference]: Finished difference Result 672 states and 877 transitions. [2024-11-13 13:54:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:54:15,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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 180 [2024-11-13 13:54:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:54:15,257 INFO L225 Difference]: With dead ends: 672 [2024-11-13 13:54:15,257 INFO L226 Difference]: Without dead ends: 398 [2024-11-13 13:54:15,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:54:15,259 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 80 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:54:15,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 386 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2024-11-13 13:54:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-13 13:54:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 344. [2024-11-13 13:54:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 285 states have (on average 1.2280701754385965) internal successors, (350), 286 states have internal predecessors, (350), 51 states have call successors, (51), 7 states have call predecessors, (51), 7 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-13 13:54:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 452 transitions. [2024-11-13 13:54:15,291 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 452 transitions. Word has length 180 [2024-11-13 13:54:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:54:15,292 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 452 transitions. [2024-11-13 13:54:15,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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-11-13 13:54:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 452 transitions. [2024-11-13 13:54:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-13 13:54:15,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:54:15,294 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, 1, 1, 1] [2024-11-13 13:54:15,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-13 13:54:15,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:54:15,495 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:54:15,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:54:15,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1263055444, now seen corresponding path program 1 times [2024-11-13 13:54:15,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:54:15,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608543208] [2024-11-13 13:54:15,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:54:15,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:54:15,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:54:15,499 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:54:15,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-11-13 13:54:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:54:16,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:54:16,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:54:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:54:16,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:54:16,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:54:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608543208] [2024-11-13 13:54:16,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608543208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:54:16,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:54:16,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:54:16,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835017583] [2024-11-13 13:54:16,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:54:16,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:54:16,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:54:16,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:54:16,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:54:16,224 INFO L87 Difference]: Start difference. First operand 344 states and 452 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-11-13 13:54:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:54:16,419 INFO L93 Difference]: Finished difference Result 624 states and 819 transitions. [2024-11-13 13:54:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:54:16,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 182 [2024-11-13 13:54:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:54:16,424 INFO L225 Difference]: With dead ends: 624 [2024-11-13 13:54:16,424 INFO L226 Difference]: Without dead ends: 350 [2024-11-13 13:54:16,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:54:16,426 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:54:16,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:54:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-13 13:54:16,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-11-13 13:54:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 291 states have (on average 1.2233676975945018) internal successors, (356), 292 states have internal predecessors, (356), 51 states have call successors, (51), 7 states have call predecessors, (51), 7 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-13 13:54:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 458 transitions. [2024-11-13 13:54:16,471 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 458 transitions. Word has length 182 [2024-11-13 13:54:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:54:16,472 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 458 transitions. [2024-11-13 13:54:16,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-11-13 13:54:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 458 transitions. [2024-11-13 13:54:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 13:54:16,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:54:16,475 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, 1, 1, 1, 1, 1] [2024-11-13 13:54:16,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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)] Ended with exit code 0 [2024-11-13 13:54:16,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:54:16,676 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:54:16,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:54:16,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1311780753, now seen corresponding path program 1 times [2024-11-13 13:54:16,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:54:16,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551465471] [2024-11-13 13:54:16,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:54:16,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:54:16,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:54:16,681 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:54:16,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-13 13:54:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:54:17,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 13:54:18,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:54:18,023 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-11-13 13:54:18,566 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-11-13 13:54:18,876 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-11-13 13:54:19,210 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 80 treesize of output 60 [2024-11-13 13:54:19,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:54:19,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:54:19,227 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 60 treesize of output 88 [2024-11-13 13:54:19,451 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-11-13 13:54:21,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:54:21,723 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 150 treesize of output 66 [2024-11-13 13:54:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 293 proven. 12 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-11-13 13:54:22,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:54:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-13 13:54:23,555 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:54:23,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551465471] [2024-11-13 13:54:23,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551465471] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 13:54:23,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:54:23,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 20 [2024-11-13 13:54:23,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538996112] [2024-11-13 13:54:23,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:54:23,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:54:23,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:54:23,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:54:23,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:54:23,559 INFO L87 Difference]: Start difference. First operand 350 states and 458 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-11-13 13:54:26,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:54:30,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:54:31,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:54:31,975 INFO L93 Difference]: Finished difference Result 629 states and 817 transitions. [2024-11-13 13:54:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:54:31,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 184 [2024-11-13 13:54:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:54:31,980 INFO L225 Difference]: With dead ends: 629 [2024-11-13 13:54:31,980 INFO L226 Difference]: Without dead ends: 627 [2024-11-13 13:54:31,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2024-11-13 13:54:31,981 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 95 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:54:31,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 957 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-13 13:54:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-13 13:54:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 624. [2024-11-13 13:54:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 537 states have (on average 1.229050279329609) internal successors, (660), 540 states have internal predecessors, (660), 75 states have call successors, (75), 11 states have call predecessors, (75), 11 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-13 13:54:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 810 transitions. [2024-11-13 13:54:32,022 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 810 transitions. Word has length 184 [2024-11-13 13:54:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:54:32,023 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 810 transitions. [2024-11-13 13:54:32,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-11-13 13:54:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 810 transitions. [2024-11-13 13:54:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 13:54:32,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:54:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:54:32,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-13 13:54:32,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:54:32,226 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:54:32,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:54:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2139181041, now seen corresponding path program 1 times [2024-11-13 13:54:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:54:32,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533960285] [2024-11-13 13:54:32,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:54:32,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:54:32,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:54:32,230 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:54:32,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89dfb034-4455-415b-bdf0-7e4d0e76b90f/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-13 13:54:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:54:39,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 13:54:39,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:54:39,595 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 101 treesize of output 100 [2024-11-13 13:54:40,335 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 187 treesize of output 158 [2024-11-13 13:54:41,860 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 187 treesize of output 160 [2024-11-13 13:54:43,662 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 193 treesize of output 164 [2024-11-13 13:54:49,237 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 289 treesize of output 240 [2024-11-13 13:54:53,901 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 177 treesize of output 154 [2024-11-13 13:54:58,762 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 172 treesize of output 149 [2024-11-13 13:55:03,938 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 167 treesize of output 146 [2024-11-13 13:55:10,254 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 162 treesize of output 143 [2024-11-13 13:55:21,041 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 162 treesize of output 143 [2024-11-13 13:55:40,387 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 157 treesize of output 140 [2024-11-13 13:56:12,532 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 162 treesize of output 145 [2024-11-13 13:56:53,593 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 157 treesize of output 140 [2024-11-13 13:58:24,046 WARN L286 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:00:32,884 WARN L286 SmtUtils]: Spent 13.99s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:00:38,350 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:00:55,049 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:01:01,062 WARN L286 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:01:18,188 WARN L286 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:01:27,379 WARN L286 SmtUtils]: Spent 7.80s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:01:41,427 WARN L286 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:02:18,742 WARN L286 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:02:28,511 WARN L286 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:02:35,762 WARN L286 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:02:40,342 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 318 treesize of output 258 [2024-11-13 14:03:14,871 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse25 (bvadd (_ bv27 32) |c_~#WrapperStruct00~0.offset|)) (.cse13 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|)) (.cse10 (bvadd (_ bv29 32) |c_~#WrapperStruct00~0.offset|)) (.cse1 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|)) (.cse6 (bvadd (_ bv20 32) |c_~#WrapperStruct00~0.offset|))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 83.0 5.0))) (.cse30 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)))) (.cse2 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32))) (.cse4 (bvadd (_ bv4 32) |c_~#WrapperStruct00~0.offset|)) (.cse7 (select .cse1 .cse6)) (.cse8 (bvadd (_ bv22 32) |c_~#WrapperStruct00~0.offset|)) (.cse9 ((_ sign_extend 24) (_ bv10 8))) (.cse11 (select .cse1 .cse10)) (.cse12 (bvadd (_ bv8 32) |c_~#WrapperStruct00~0.offset|)) (.cse14 (select .cse1 .cse13)) (.cse15 (bvadd (_ bv10 32) |c_~#WrapperStruct00~0.offset|)) (.cse17 (bvadd (_ bv14 32) |c_~#WrapperStruct00~0.offset|)) (.cse19 (bvadd (_ bv19 32) |c_~#WrapperStruct00~0.offset|)) (.cse20 (bvadd (_ bv21 32) |c_~#WrapperStruct00~0.offset|)) (.cse21 (bvadd (_ bv23 32) |c_~#WrapperStruct00~0.offset|)) (.cse22 (bvadd (_ bv24 32) |c_~#WrapperStruct00~0.offset|)) (.cse23 (bvadd (_ bv25 32) |c_~#WrapperStruct00~0.offset|)) (.cse24 (bvadd (_ bv26 32) |c_~#WrapperStruct00~0.offset|)) (.cse26 (select .cse1 .cse25)) (.cse27 (bvadd (_ bv28 32) |c_~#WrapperStruct00~0.offset|)) (.cse28 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|))) (or (exists ((v_skolemized_v_prenex_1_23 (_ BitVec 64))) (and (= .cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_23) ((_ extract 62 52) v_skolemized_v_prenex_1_23) ((_ extract 51 0) v_skolemized_v_prenex_1_23))) (exists ((|v_skolemized_q#valueAsBitvector_51| (_ BitVec 64))) (let ((.cse18 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_51|)) (.cse16 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_51|))) (let ((.cse29 (let ((.cse33 (concat .cse18 .cse16))) (fp ((_ extract 63 63) .cse33) ((_ extract 62 52) .cse33) ((_ extract 51 0) .cse33)))) (.cse5 ((_ extract 63 32) v_skolemized_v_prenex_1_23)) (.cse3 ((_ extract 31 0) v_skolemized_v_prenex_1_23))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_29| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet62#1_27| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet53#1_29| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet59#1_28| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet33#1_26| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet56#1_29| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet65#1_28| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet71#1_30| (_ BitVec 8))) (= .cse1 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse2 |c_~#WrapperStruct00~0.offset| .cse3) .cse4 .cse5) .cse6 .cse7) .cse8 .cse9) .cse10 .cse11) .cse12 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet33#1_26|)) .cse13 .cse14) .cse15 .cse16) .cse17 .cse18) .cse19 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_29|)) .cse20 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_29|)) .cse21 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet56#1_29|)) .cse22 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_28|)) .cse23 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_27|)) .cse24 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_28|)) .cse25 .cse26) .cse27 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet71#1_30|)) .cse28 ((_ sign_extend 24) (_ bv1 8))))) (fp.geq .cse29 .cse30) (not (let ((.cse31 (let ((.cse32 (concat .cse5 .cse3))) (fp ((_ extract 63 63) .cse32) ((_ extract 62 52) .cse32) ((_ extract 51 0) .cse32))))) (fp.geq .cse31 (fp.neg (fp.mul c_currentRoundingMode .cse29 .cse31))))))))))) (exists ((v_skolemized_v_prenex_1_23 (_ BitVec 64))) (and (= .cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_23) ((_ extract 62 52) v_skolemized_v_prenex_1_23) ((_ extract 51 0) v_skolemized_v_prenex_1_23))) (exists ((|v_skolemized_q#valueAsBitvector_51| (_ BitVec 64))) (let ((.cse40 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_51|)) (.cse39 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_51|))) (let ((.cse34 (let ((.cse41 (concat .cse40 .cse39))) (fp ((_ extract 63 63) .cse41) ((_ extract 62 52) .cse41) ((_ extract 51 0) .cse41)))) (.cse38 ((_ extract 31 0) v_skolemized_v_prenex_1_23)) (.cse37 ((_ extract 63 32) v_skolemized_v_prenex_1_23))) (and (fp.geq .cse34 .cse30) (not (let ((.cse35 (let ((.cse36 (concat .cse37 .cse38))) (fp ((_ extract 63 63) .cse36) ((_ extract 62 52) .cse36) ((_ extract 51 0) .cse36))))) (fp.geq .cse35 (fp.neg (fp.mul c_currentRoundingMode .cse34 .cse35))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet47#1_29| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet62#1_27| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet53#1_29| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet59#1_28| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet33#1_26| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet56#1_29| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet65#1_28| (_ BitVec 8)) (|v_ULTIMATE.start_updateVariables_#t~nondet71#1_30| (_ BitVec 8))) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse2 |c_~#WrapperStruct00~0.offset| .cse38) .cse4 .cse37) .cse6 .cse7) .cse8 .cse9) .cse10 .cse11) .cse12 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet33#1_26|)) .cse13 .cse14) .cse15 .cse39) .cse17 .cse40) .cse19 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet47#1_29|)) .cse20 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet53#1_29|)) .cse21 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet56#1_29|)) .cse22 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_28|)) .cse23 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_27|)) .cse24 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet65#1_28|)) .cse25 .cse26) .cse27 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet71#1_30|)) .cse28 ((_ sign_extend 24) (_ bv0 8))) .cse1))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false