./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX --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 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:35:15,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:35:15,652 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:35:15,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:35:15,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:35:15,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:35:15,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:35:15,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:35:15,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:35:15,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:35:15,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:35:15,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:35:15,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:35:15,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:35:15,721 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:35:15,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:35:15,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:35:15,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:35:15,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:35:15,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:35:15,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:35:15,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:35:15,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:35:15,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:35:15,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:35:15,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:35:15,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:35:15,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:35:15,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:35:15,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:35:15,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:35:15,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:35:15,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:35:15,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:35:15,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:35:15,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:35:15,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:35:15,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:35:15,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:35:15,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:35:15,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:35:15,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:35:15,740 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX 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 -> 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 [2024-11-08 17:35:16,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:35:16,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:35:16,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:35:16,142 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:35:16,143 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:35:16,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i Unable to find full path for "g++" [2024-11-08 17:35:18,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:35:18,536 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:35:18,537 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2024-11-08 17:35:18,550 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/data/9c7d42478/17bba54628494bc1a7c0149821279c91/FLAG627df43fc [2024-11-08 17:35:18,570 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/data/9c7d42478/17bba54628494bc1a7c0149821279c91 [2024-11-08 17:35:18,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:35:18,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:35:18,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:35:18,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:35:18,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:35:18,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:35:18" (1/1) ... [2024-11-08 17:35:18,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3e5b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:18, skipping insertion in model container [2024-11-08 17:35:18,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:35:18" (1/1) ... [2024-11-08 17:35:18,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:35:18,873 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_afd0855e-fff1-4094-8388-c3f22587893d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2024-11-08 17:35:18,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:35:18,988 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:35:19,005 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_afd0855e-fff1-4094-8388-c3f22587893d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2024-11-08 17:35:19,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:35:19,144 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:35:19,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19 WrapperNode [2024-11-08 17:35:19,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:35:19,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:35:19,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:35:19,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:35:19,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,240 INFO L138 Inliner]: procedures = 30, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 660 [2024-11-08 17:35:19,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:35:19,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:35:19,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:35:19,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:35:19,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,272 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 17:35:19,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:35:19,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:35:19,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:35:19,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:35:19,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (1/1) ... [2024-11-08 17:35:19,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:35:19,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:35:19,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:35:19,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:35:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:35:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 17:35:19,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 17:35:19,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 17:35:19,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 17:35:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 17:35:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 17:35:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:35:19,422 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:35:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 17:35:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:35:19,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:35:19,602 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:35:19,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:35:20,712 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2024-11-08 17:35:20,712 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:35:20,740 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:35:20,740 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:35:20,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:35:20 BoogieIcfgContainer [2024-11-08 17:35:20,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:35:20,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:35:20,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:35:20,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:35:20,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:35:18" (1/3) ... [2024-11-08 17:35:20,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ae8fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:35:20, skipping insertion in model container [2024-11-08 17:35:20,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:19" (2/3) ... [2024-11-08 17:35:20,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ae8fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:35:20, skipping insertion in model container [2024-11-08 17:35:20,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:35:20" (3/3) ... [2024-11-08 17:35:20,752 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-63.i [2024-11-08 17:35:20,770 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:35:20,770 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:35:20,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:35:20,847 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;@638b1e81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:35:20,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:35:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:35:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:35:20,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:20,872 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:20,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:20,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash -989647799, now seen corresponding path program 1 times [2024-11-08 17:35:20,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:20,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911722656] [2024-11-08 17:35:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:20,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:21,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:21,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911722656] [2024-11-08 17:35:21,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911722656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:21,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:21,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:35:21,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458130561] [2024-11-08 17:35:21,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:21,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:35:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:21,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:35:21,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:35:21,589 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:35:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:21,631 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-08 17:35:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:35:21,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-08 17:35:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:21,647 INFO L225 Difference]: With dead ends: 271 [2024-11-08 17:35:21,647 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 17:35:21,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-08 17:35:21,655 INFO L432 NwaCegarLoop]: 198 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, 198 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-08 17:35:21,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 17:35:21,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-08 17:35:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:35:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-08 17:35:21,721 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-08 17:35:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:21,721 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-08 17:35:21,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:35:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-08 17:35:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:35:21,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:21,736 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:21,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:35:21,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:21,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash -559874595, now seen corresponding path program 1 times [2024-11-08 17:35:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195396473] [2024-11-08 17:35:21,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:21,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:22,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195396473] [2024-11-08 17:35:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195396473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:22,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558887413] [2024-11-08 17:35:22,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:22,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:22,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:22,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:22,564 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:22,665 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-08 17:35:22,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:22,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-08 17:35:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:22,668 INFO L225 Difference]: With dead ends: 269 [2024-11-08 17:35:22,668 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 17:35:22,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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-08 17:35:22,675 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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-08 17:35:22,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:22,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 17:35:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-08 17:35:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:35:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-08 17:35:22,708 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-08 17:35:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:22,711 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-08 17:35:22,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-08 17:35:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:35:22,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:22,721 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:22,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:35:22,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:22,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1982844472, now seen corresponding path program 1 times [2024-11-08 17:35:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:22,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953284442] [2024-11-08 17:35:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:22,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:23,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:23,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953284442] [2024-11-08 17:35:23,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953284442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:23,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:23,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:23,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204069561] [2024-11-08 17:35:23,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:23,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:23,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:23,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:23,137 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:23,188 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2024-11-08 17:35:23,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:23,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:35:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:23,194 INFO L225 Difference]: With dead ends: 274 [2024-11-08 17:35:23,194 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 17:35:23,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-08 17:35:23,197 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:23,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 17:35:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-11-08 17:35:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:35:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-08 17:35:23,220 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 158 [2024-11-08 17:35:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:23,220 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-08 17:35:23,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-08 17:35:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:35:23,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:23,228 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:23,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:35:23,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:23,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:23,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1396038458, now seen corresponding path program 1 times [2024-11-08 17:35:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:23,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186097717] [2024-11-08 17:35:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:23,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:23,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:23,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186097717] [2024-11-08 17:35:23,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186097717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:23,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:23,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:23,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039722332] [2024-11-08 17:35:23,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:23,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:23,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:23,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:23,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:23,562 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:23,606 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2024-11-08 17:35:23,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:23,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:35:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:23,610 INFO L225 Difference]: With dead ends: 278 [2024-11-08 17:35:23,611 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 17:35:23,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-08 17:35:23,613 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:23,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 17:35:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-08 17:35:23,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:35:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-08 17:35:23,633 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 158 [2024-11-08 17:35:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:23,633 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-08 17:35:23,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-08 17:35:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:35:23,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:23,639 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:23,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:35:23,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:23,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2076096828, now seen corresponding path program 1 times [2024-11-08 17:35:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:23,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2286280] [2024-11-08 17:35:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:23,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:23,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2286280] [2024-11-08 17:35:23,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2286280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:23,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:23,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:23,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685782230] [2024-11-08 17:35:23,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:23,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:23,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:23,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:23,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:23,975 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:24,019 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2024-11-08 17:35:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:24,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:35:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:24,021 INFO L225 Difference]: With dead ends: 282 [2024-11-08 17:35:24,021 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 17:35:24,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-08 17:35:24,023 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 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-08 17:35:24,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 17:35:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-08 17:35:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:35:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-08 17:35:24,033 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2024-11-08 17:35:24,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:24,033 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-08 17:35:24,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-08 17:35:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:35:24,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:24,036 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:24,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:35:24,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:24,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash -443863106, now seen corresponding path program 1 times [2024-11-08 17:35:24,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:24,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294258816] [2024-11-08 17:35:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:24,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294258816] [2024-11-08 17:35:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294258816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:24,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:24,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:24,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971757079] [2024-11-08 17:35:24,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:24,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:24,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:24,285 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:24,316 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2024-11-08 17:35:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:24,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:35:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:24,319 INFO L225 Difference]: With dead ends: 286 [2024-11-08 17:35:24,319 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 17:35:24,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-08 17:35:24,321 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 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-08 17:35:24,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 17:35:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-08 17:35:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:35:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2024-11-08 17:35:24,329 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 158 [2024-11-08 17:35:24,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:24,330 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2024-11-08 17:35:24,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2024-11-08 17:35:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:35:24,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:24,333 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:24,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:35:24,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:24,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash -442016064, now seen corresponding path program 1 times [2024-11-08 17:35:24,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:24,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418344141] [2024-11-08 17:35:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:35:26,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:26,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418344141] [2024-11-08 17:35:26,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418344141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:35:26,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226858960] [2024-11-08 17:35:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:26,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:35:26,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:35:26,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:35:26,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:35:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:27,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 17:35:27,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:35:27,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 17:35:27,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 17:35:27,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 17:35:27,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 17:35:27,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 17:35:27,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 17:35:27,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 17:35:28,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 17:35:28,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 20 [2024-11-08 17:35:28,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:35:28,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 37 [2024-11-08 17:35:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-08 17:35:28,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:35:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:35:29,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226858960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:35:29,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:35:29,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2024-11-08 17:35:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333041923] [2024-11-08 17:35:29,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:35:29,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:35:29,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:29,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:35:29,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:35:29,068 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) [2024-11-08 17:35:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:31,250 INFO L93 Difference]: Finished difference Result 380 states and 535 transitions. [2024-11-08 17:35:31,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 17:35:31,251 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) Word has length 158 [2024-11-08 17:35:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:31,252 INFO L225 Difference]: With dead ends: 380 [2024-11-08 17:35:31,252 INFO L226 Difference]: Without dead ends: 238 [2024-11-08 17:35:31,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 340 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 17:35:31,254 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 656 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:31,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 618 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 17:35:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-08 17:35:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 153. [2024-11-08 17:35:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 131 states have (on average 1.3511450381679388) internal successors, (177), 131 states have internal predecessors, (177), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:35:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 213 transitions. [2024-11-08 17:35:31,268 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 213 transitions. Word has length 158 [2024-11-08 17:35:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:31,268 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 213 transitions. [2024-11-08 17:35:31,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 7 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (37), 4 states have call predecessors, (37), 7 states have call successors, (37) [2024-11-08 17:35:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 213 transitions. [2024-11-08 17:35:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:35:31,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:31,271 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:31,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:35:31,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 17:35:31,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:31,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1858806526, now seen corresponding path program 1 times [2024-11-08 17:35:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:31,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862444941] [2024-11-08 17:35:31,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:34,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:34,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862444941] [2024-11-08 17:35:34,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862444941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:34,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:34,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:35:34,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988477982] [2024-11-08 17:35:34,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:34,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:35:34,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:34,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:35:34,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:35:34,118 INFO L87 Difference]: Start difference. First operand 153 states and 213 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:34,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:34,752 INFO L93 Difference]: Finished difference Result 451 states and 631 transitions. [2024-11-08 17:35:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:35:34,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:35:34,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:34,755 INFO L225 Difference]: With dead ends: 451 [2024-11-08 17:35:34,756 INFO L226 Difference]: Without dead ends: 301 [2024-11-08 17:35:34,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:35:34,757 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 126 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:34,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 468 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:35:34,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-08 17:35:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 295. [2024-11-08 17:35:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 252 states have (on average 1.3571428571428572) internal successors, (342), 252 states have internal predecessors, (342), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:35:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 414 transitions. [2024-11-08 17:35:34,786 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 414 transitions. Word has length 158 [2024-11-08 17:35:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:34,787 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 414 transitions. [2024-11-08 17:35:34,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 414 transitions. [2024-11-08 17:35:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:35:34,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:34,790 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:34,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:35:34,791 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:34,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:34,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1401958123, now seen corresponding path program 1 times [2024-11-08 17:35:34,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:34,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900434614] [2024-11-08 17:35:34,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:34,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:36,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900434614] [2024-11-08 17:35:36,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900434614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:36,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:36,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:35:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576150201] [2024-11-08 17:35:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:36,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:35:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:36,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:35:36,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:35:36,711 INFO L87 Difference]: Start difference. First operand 295 states and 414 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:35:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:37,917 INFO L93 Difference]: Finished difference Result 641 states and 895 transitions. [2024-11-08 17:35:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:35:37,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-11-08 17:35:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:37,922 INFO L225 Difference]: With dead ends: 641 [2024-11-08 17:35:37,923 INFO L226 Difference]: Without dead ends: 349 [2024-11-08 17:35:37,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:35:37,925 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 129 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:37,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 657 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:35:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-08 17:35:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 348. [2024-11-08 17:35:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 295 states have (on average 1.3457627118644069) internal successors, (397), 296 states have internal predecessors, (397), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:35:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 481 transitions. [2024-11-08 17:35:37,977 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 481 transitions. Word has length 160 [2024-11-08 17:35:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:37,978 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 481 transitions. [2024-11-08 17:35:37,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:35:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 481 transitions. [2024-11-08 17:35:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:35:37,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:37,981 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:37,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:35:37,982 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:37,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1988764137, now seen corresponding path program 1 times [2024-11-08 17:35:37,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:37,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44041129] [2024-11-08 17:35:37,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:37,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:38,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44041129] [2024-11-08 17:35:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44041129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:38,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:35:38,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126471149] [2024-11-08 17:35:38,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:38,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:35:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:38,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:35:38,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:35:38,512 INFO L87 Difference]: Start difference. First operand 348 states and 481 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:39,299 INFO L93 Difference]: Finished difference Result 914 states and 1256 transitions. [2024-11-08 17:35:39,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:35:39,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-08 17:35:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:39,305 INFO L225 Difference]: With dead ends: 914 [2024-11-08 17:35:39,306 INFO L226 Difference]: Without dead ends: 610 [2024-11-08 17:35:39,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:35:39,307 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 138 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:39,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 970 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:35:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-08 17:35:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 490. [2024-11-08 17:35:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 415 states have (on average 1.3325301204819278) internal successors, (553), 417 states have internal predecessors, (553), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 17:35:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 673 transitions. [2024-11-08 17:35:39,363 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 673 transitions. Word has length 160 [2024-11-08 17:35:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:39,364 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 673 transitions. [2024-11-08 17:35:39,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 673 transitions. [2024-11-08 17:35:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:35:39,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:39,367 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:39,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:35:39,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:39,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1151834243, now seen corresponding path program 1 times [2024-11-08 17:35:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:39,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841459083] [2024-11-08 17:35:39,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:39,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:41,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:41,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841459083] [2024-11-08 17:35:41,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841459083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:41,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:41,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:35:41,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372713015] [2024-11-08 17:35:41,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:41,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:35:41,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:41,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:35:41,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:35:41,147 INFO L87 Difference]: Start difference. First operand 490 states and 673 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:35:42,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:42,682 INFO L93 Difference]: Finished difference Result 822 states and 1128 transitions. [2024-11-08 17:35:42,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:35:42,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-11-08 17:35:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:42,687 INFO L225 Difference]: With dead ends: 822 [2024-11-08 17:35:42,687 INFO L226 Difference]: Without dead ends: 648 [2024-11-08 17:35:42,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:35:42,688 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 159 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:42,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 889 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 17:35:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-08 17:35:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 519. [2024-11-08 17:35:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 444 states have (on average 1.34009009009009) internal successors, (595), 446 states have internal predecessors, (595), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 17:35:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 715 transitions. [2024-11-08 17:35:42,774 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 715 transitions. Word has length 160 [2024-11-08 17:35:42,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:42,776 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 715 transitions. [2024-11-08 17:35:42,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:35:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 715 transitions. [2024-11-08 17:35:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:35:42,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:42,780 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:42,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:35:42,781 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:42,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1853434117, now seen corresponding path program 1 times [2024-11-08 17:35:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:42,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409553878] [2024-11-08 17:35:42,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:43,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:43,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409553878] [2024-11-08 17:35:43,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409553878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:43,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:43,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:35:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137130279] [2024-11-08 17:35:43,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:43,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:35:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:43,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:35:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:35:43,704 INFO L87 Difference]: Start difference. First operand 519 states and 715 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:44,546 INFO L93 Difference]: Finished difference Result 891 states and 1228 transitions. [2024-11-08 17:35:44,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:35:44,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-08 17:35:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:44,550 INFO L225 Difference]: With dead ends: 891 [2024-11-08 17:35:44,550 INFO L226 Difference]: Without dead ends: 690 [2024-11-08 17:35:44,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:35:44,552 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 170 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:44,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 558 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:35:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-08 17:35:44,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 681. [2024-11-08 17:35:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 584 states have (on average 1.3407534246575343) internal successors, (783), 586 states have internal predecessors, (783), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 17:35:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 939 transitions. [2024-11-08 17:35:44,629 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 939 transitions. Word has length 160 [2024-11-08 17:35:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:44,630 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 939 transitions. [2024-11-08 17:35:44,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 939 transitions. [2024-11-08 17:35:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:35:44,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:44,633 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:44,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:35:44,634 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:44,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash 983891879, now seen corresponding path program 1 times [2024-11-08 17:35:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231861590] [2024-11-08 17:35:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:46,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:46,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231861590] [2024-11-08 17:35:46,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231861590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:46,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:46,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:35:46,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850696083] [2024-11-08 17:35:46,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:46,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:35:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:46,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:35:46,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:35:46,546 INFO L87 Difference]: Start difference. First operand 681 states and 939 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:35:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:47,346 INFO L93 Difference]: Finished difference Result 695 states and 956 transitions. [2024-11-08 17:35:47,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:35:47,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2024-11-08 17:35:47,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:47,351 INFO L225 Difference]: With dead ends: 695 [2024-11-08 17:35:47,352 INFO L226 Difference]: Without dead ends: 693 [2024-11-08 17:35:47,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:35:47,353 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 106 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:47,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 567 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:35:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-08 17:35:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-11-08 17:35:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 596 states have (on average 1.3338926174496644) internal successors, (795), 598 states have internal predecessors, (795), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 17:35:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 951 transitions. [2024-11-08 17:35:47,431 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 951 transitions. Word has length 163 [2024-11-08 17:35:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:47,432 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 951 transitions. [2024-11-08 17:35:47,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:35:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 951 transitions. [2024-11-08 17:35:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:35:47,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:47,435 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:47,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:35:47,435 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:47,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:47,436 INFO L85 PathProgramCache]: Analyzing trace with hash 985738921, now seen corresponding path program 1 times [2024-11-08 17:35:47,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:47,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823343918] [2024-11-08 17:35:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:47,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:48,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:48,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823343918] [2024-11-08 17:35:48,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823343918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:48,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:48,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:35:48,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500173802] [2024-11-08 17:35:48,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:48,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:35:48,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:48,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:35:48,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:35:48,193 INFO L87 Difference]: Start difference. First operand 693 states and 951 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:48,561 INFO L93 Difference]: Finished difference Result 1358 states and 1854 transitions. [2024-11-08 17:35:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:35:48,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-08 17:35:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:48,565 INFO L225 Difference]: With dead ends: 1358 [2024-11-08 17:35:48,566 INFO L226 Difference]: Without dead ends: 709 [2024-11-08 17:35:48,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-08 17:35:48,568 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 126 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:48,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 338 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:35:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-08 17:35:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 685. [2024-11-08 17:35:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 595 states have (on average 1.3277310924369747) internal successors, (790), 597 states have internal predecessors, (790), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 17:35:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 926 transitions. [2024-11-08 17:35:48,643 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 926 transitions. Word has length 163 [2024-11-08 17:35:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:48,644 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 926 transitions. [2024-11-08 17:35:48,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 926 transitions. [2024-11-08 17:35:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:35:48,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:48,647 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:48,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:35:48,647 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:48,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1534221013, now seen corresponding path program 1 times [2024-11-08 17:35:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349264949] [2024-11-08 17:35:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349264949] [2024-11-08 17:35:49,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349264949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:49,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:49,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:35:49,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915721342] [2024-11-08 17:35:49,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:49,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:35:49,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:49,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:35:49,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:35:49,148 INFO L87 Difference]: Start difference. First operand 685 states and 926 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:49,522 INFO L93 Difference]: Finished difference Result 1326 states and 1792 transitions. [2024-11-08 17:35:49,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:35:49,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-08 17:35:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:49,527 INFO L225 Difference]: With dead ends: 1326 [2024-11-08 17:35:49,527 INFO L226 Difference]: Without dead ends: 685 [2024-11-08 17:35:49,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-08 17:35:49,529 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 153 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:49,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 283 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:35:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-08 17:35:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2024-11-08 17:35:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 595 states have (on average 1.3210084033613445) internal successors, (786), 597 states have internal predecessors, (786), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 17:35:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 922 transitions. [2024-11-08 17:35:49,610 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 922 transitions. Word has length 163 [2024-11-08 17:35:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:49,611 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 922 transitions. [2024-11-08 17:35:49,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 922 transitions. [2024-11-08 17:35:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:35:49,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:49,614 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:49,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:35:49,614 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:49,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:49,615 INFO L85 PathProgramCache]: Analyzing trace with hash -854162643, now seen corresponding path program 1 times [2024-11-08 17:35:49,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:49,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027250221] [2024-11-08 17:35:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 17:35:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:35:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:35:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:35:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:35:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:35:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:35:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:35:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:35:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:35:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:35:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:35:49,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:49,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027250221] [2024-11-08 17:35:49,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027250221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:49,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:49,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:35:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229371984] [2024-11-08 17:35:49,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:49,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:35:49,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:49,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:35:49,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:35:49,885 INFO L87 Difference]: Start difference. First operand 685 states and 922 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:49,985 INFO L93 Difference]: Finished difference Result 1338 states and 1800 transitions. [2024-11-08 17:35:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:35:49,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-08 17:35:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:49,990 INFO L225 Difference]: With dead ends: 1338 [2024-11-08 17:35:49,990 INFO L226 Difference]: Without dead ends: 697 [2024-11-08 17:35:49,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-08 17:35:49,992 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 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-08 17:35:49,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-08 17:35:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-11-08 17:35:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 607 states have (on average 1.314662273476112) internal successors, (798), 609 states have internal predecessors, (798), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 17:35:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 934 transitions. [2024-11-08 17:35:50,095 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 934 transitions. Word has length 163 [2024-11-08 17:35:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:50,096 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 934 transitions. [2024-11-08 17:35:50,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:35:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 934 transitions. [2024-11-08 17:35:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 17:35:50,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:50,099 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:35:50,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:35:50,100 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:50,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:50,100 INFO L85 PathProgramCache]: Analyzing trace with hash -588543405, now seen corresponding path program 1 times [2024-11-08 17:35:50,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:50,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343869071] [2024-11-08 17:35:50,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:50,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:35:50,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:35:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:35:50,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:35:50,382 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:35:50,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:35:50,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:35:50,389 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:35:50,495 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:35:50,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:35:50 BoogieIcfgContainer [2024-11-08 17:35:50,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:35:50,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:35:50,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:35:50,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:35:50,502 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:35:20" (3/4) ... [2024-11-08 17:35:50,504 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:35:50,506 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:35:50,506 INFO L158 Benchmark]: Toolchain (without parser) took 31931.53ms. Allocated memory was 169.9MB in the beginning and 625.0MB in the end (delta: 455.1MB). Free memory was 125.9MB in the beginning and 487.2MB in the end (delta: -361.3MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. [2024-11-08 17:35:50,507 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 130.0MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:35:50,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.96ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 104.9MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 17:35:50,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.41ms. Allocated memory is still 169.9MB. Free memory was 104.9MB in the beginning and 100.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:35:50,508 INFO L158 Benchmark]: Boogie Preprocessor took 93.34ms. Allocated memory is still 169.9MB. Free memory was 100.2MB in the beginning and 95.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:35:50,508 INFO L158 Benchmark]: RCFGBuilder took 1406.10ms. Allocated memory is still 169.9MB. Free memory was 95.5MB in the beginning and 130.7MB in the end (delta: -35.2MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2024-11-08 17:35:50,508 INFO L158 Benchmark]: TraceAbstraction took 29756.44ms. Allocated memory was 169.9MB in the beginning and 625.0MB in the end (delta: 455.1MB). Free memory was 129.6MB in the beginning and 488.3MB in the end (delta: -358.6MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2024-11-08 17:35:50,509 INFO L158 Benchmark]: Witness Printer took 5.14ms. Allocated memory is still 625.0MB. Free memory was 488.3MB in the beginning and 487.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:35:50,510 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 130.0MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.96ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 104.9MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.41ms. Allocated memory is still 169.9MB. Free memory was 104.9MB in the beginning and 100.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.34ms. Allocated memory is still 169.9MB. Free memory was 100.2MB in the beginning and 95.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1406.10ms. Allocated memory is still 169.9MB. Free memory was 95.5MB in the beginning and 130.7MB in the end (delta: -35.2MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29756.44ms. Allocated memory was 169.9MB in the beginning and 625.0MB in the end (delta: 455.1MB). Free memory was 129.6MB in the beginning and 488.3MB in the end (delta: -358.6MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. * Witness Printer took 5.14ms. Allocated memory is still 625.0MB. Free memory was 488.3MB in the beginning and 487.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 119. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 8.3, 2.25, 10.3, 0, 128, 9.8, 1, 32, -10, 16, 25, 1, 0, 32, 256, 16, 0 }; [L63] signed short int last_1_WrapperStruct00_var_1_21 = 256; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_21=256] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_21 [L116] last_1_WrapperStruct00_var_1_21 = WrapperStruct00.var_1_21 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L85] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L86] EXPR WrapperStruct00.var_1_2 [L86] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L86] EXPR WrapperStruct00.var_1_2 [L86] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L86] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_3 [L88] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L89] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_4 [L90] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L91] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L94] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_8 [L95] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_8 [L95] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L96] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L97] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L99] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L102] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L105] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L108] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L111] WrapperStruct00.var_1_20 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L127] RET updateVariables() [L128] CALL step() [L67] EXPR WrapperStruct00.var_1_14 [L67] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_14 [L68] WrapperStruct00.var_1_21 = last_1_WrapperStruct00_var_1_21 [L69] EXPR WrapperStruct00.var_1_16 [L69] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_16 [L70] EXPR WrapperStruct00.var_1_6 [L70] WrapperStruct00.var_1_23 = WrapperStruct00.var_1_6 [L71] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] EXPR ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] EXPR WrapperStruct00.var_1_3 [L71] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L71] COND FALSE !(((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) [L74] EXPR WrapperStruct00.var_1_22 [L74] signed char stepLocal_0 = WrapperStruct00.var_1_22; [L75] EXPR WrapperStruct00.var_1_22 [L75] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=62] [L75] EXPR ((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21) [L75] EXPR WrapperStruct00.var_1_22 [L75] EXPR ((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256, stepLocal_0=62] [L75] COND FALSE !(stepLocal_0 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L78] COND FALSE !(WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) [L81] EXPR WrapperStruct00.var_1_22 [L81] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_22 [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_3 [L119] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))) [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_2 [L119] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L119] EXPR WrapperStruct00.var_1_3 [L119] EXPR ((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)) [L119] EXPR WrapperStruct00.var_1_7 [L119] EXPR WrapperStruct00.var_1_22 [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) [L119] EXPR WrapperStruct00.var_1_22 [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))) [L119] EXPR WrapperStruct00.var_1_22 [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) [L119] EXPR WrapperStruct00.var_1_22 [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR (((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR ((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119] EXPR (((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_23 == ((unsigned char) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L119-L120] return (((((((((((1.1f) < (WrapperStruct00.var_1_2)) ? (1.1f) : (WrapperStruct00.var_1_2))) > (WrapperStruct00.var_1_3 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_23 && WrapperStruct00.var_1_6))) : 1) && ((WrapperStruct00.var_1_4 <= (((((WrapperStruct00.var_1_2) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) > (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) ? ((((((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_22 + WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_15)))) : (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))) : (WrapperStruct00.var_1_7 == ((signed long int) WrapperStruct00.var_1_22)))) && (WrapperStruct00.var_1_13 == ((unsigned long int) WrapperStruct00.var_1_14))) && ((WrapperStruct00.var_1_22 != ((((WrapperStruct00.var_1_22) < (WrapperStruct00.var_1_21)) ? (WrapperStruct00.var_1_22) : (WrapperStruct00.var_1_21)))) ? (WrapperStruct00.var_1_15 == ((signed char) ((((((10 + WrapperStruct00.var_1_16)) < (WrapperStruct00.var_1_17)) ? ((10 + WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_17))) - ((32 - WrapperStruct00.var_1_18) + ((((WrapperStruct00.var_1_19) > (WrapperStruct00.var_1_20)) ? (WrapperStruct00.var_1_19) : (WrapperStruct00.var_1_20))))))) : 1)) && (WrapperStruct00.var_1_21 == ((signed short int) last_1_WrapperStruct00_var_1_21))) && (WrapperStruct00.var_1_22 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_23 == ((unsigned char) WrapperStruct00.var_1_6)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_21=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 17, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1776 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1767 mSDsluCounter, 9183 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6546 mSDsCounter, 169 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4997 IncrementalHoareTripleChecker+Invalid, 5166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 169 mSolverCounterUnsat, 2637 mSDtfsCounter, 4997 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1088 GetRequests, 976 SyntacticMatches, 10 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=697occurred in iteration=16, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 378 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 2877 NumberOfCodeBlocks, 2877 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2850 ConstructedInterpolants, 0 QuantifiedInterpolants, 9605 SizeOfPredicates, 1 NumberOfNonLiveVariables, 582 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 10899/11016 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-08 17:35:50,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX --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 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:35:53,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:35:53,145 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:35:53,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:35:53,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:35:53,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:35:53,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:35:53,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:35:53,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:35:53,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:35:53,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:35:53,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:35:53,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:35:53,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:35:53,195 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:35:53,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:35:53,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:35:53,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:35:53,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:35:53,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:35:53,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:35:53,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:35:53,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:35:53,199 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:35:53,199 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:35:53,200 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:35:53,200 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:35:53,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:35:53,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:35:53,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:35:53,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:35:53,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:35:53,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:35:53,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:35:53,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:35:53,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:35:53,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:35:53,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:35:53,204 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:35:53,205 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:35:53,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:35:53,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:35:53,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:35:53,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:35:53,206 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX 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 -> 604cfb29576ea4c543db163700e97b69283a966f7935f033f196cab6c7aef2e6 [2024-11-08 17:35:53,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:35:53,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:35:53,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:35:53,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:35:53,676 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:35:53,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i Unable to find full path for "g++" [2024-11-08 17:35:55,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:35:56,058 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:35:56,058 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i [2024-11-08 17:35:56,074 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/data/48ff57d31/25853453de84466d938269962edf4062/FLAG42120de0d [2024-11-08 17:35:56,096 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/data/48ff57d31/25853453de84466d938269962edf4062 [2024-11-08 17:35:56,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:35:56,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:35:56,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:35:56,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:35:56,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:35:56,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dacb157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56, skipping insertion in model container [2024-11-08 17:35:56,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:35:56,383 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_afd0855e-fff1-4094-8388-c3f22587893d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2024-11-08 17:35:56,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:35:56,499 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:35:56,514 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_afd0855e-fff1-4094-8388-c3f22587893d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-63.i[916,929] [2024-11-08 17:35:56,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:35:56,622 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:35:56,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56 WrapperNode [2024-11-08 17:35:56,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:35:56,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:35:56,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:35:56,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:35:56,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,714 INFO L138 Inliner]: procedures = 37, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 654 [2024-11-08 17:35:56,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:35:56,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:35:56,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:35:56,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:35:56,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,761 INFO L175 MemorySlicer]: Split 175 memory accesses to 2 slices as follows [2, 173]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 38 writes are split as follows [0, 38]. [2024-11-08 17:35:56,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:35:56,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:35:56,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:35:56,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:35:56,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (1/1) ... [2024-11-08 17:35:56,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:35:56,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:35:56,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:35:56,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:35:56,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:35:56,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:35:56,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:35:56,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:35:56,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:35:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 17:35:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 17:35:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:35:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:35:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 17:35:56,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 17:35:56,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 17:35:56,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 17:35:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 17:35:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 17:35:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 17:35:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 17:35:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 17:35:56,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 17:35:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:35:56,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:35:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-08 17:35:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-08 17:35:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:35:56,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:35:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:35:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:35:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 17:35:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 17:35:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:35:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:35:57,188 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:35:57,190 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:36:00,469 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-08 17:36:00,469 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:36:00,495 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:36:00,497 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:36:00,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:36:00 BoogieIcfgContainer [2024-11-08 17:36:00,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:36:00,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:36:00,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:36:00,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:36:00,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:35:56" (1/3) ... [2024-11-08 17:36:00,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1ed7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:36:00, skipping insertion in model container [2024-11-08 17:36:00,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:56" (2/3) ... [2024-11-08 17:36:00,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1ed7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:36:00, skipping insertion in model container [2024-11-08 17:36:00,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:36:00" (3/3) ... [2024-11-08 17:36:00,510 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-63.i [2024-11-08 17:36:00,530 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:36:00,530 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:36:00,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:36:00,629 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;@456c6ee3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:36:00,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:36:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:36:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:36:00,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:00,662 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:36:00,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:00,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1535678059, now seen corresponding path program 1 times [2024-11-08 17:36:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:36:00,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547363479] [2024-11-08 17:36:00,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:00,691 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-08 17:36:00,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:36:00,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:00,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:01,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:36:01,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:36:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-08 17:36:01,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:36:01,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:36:01,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547363479] [2024-11-08 17:36:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547363479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:01,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:01,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:36:01,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295799542] [2024-11-08 17:36:01,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:01,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:36:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:36:01,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:36:01,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:36:01,563 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:36:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:01,609 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-08 17:36:01,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:36:01,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-08 17:36:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:01,621 INFO L225 Difference]: With dead ends: 271 [2024-11-08 17:36:01,621 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 17:36:01,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-08 17:36:01,630 INFO L432 NwaCegarLoop]: 198 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, 198 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-08 17:36:01,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:36:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 17:36:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-08 17:36:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:36:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-08 17:36:01,687 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-08 17:36:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:01,688 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-08 17:36:01,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:36:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-08 17:36:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:36:01,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:01,692 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:36:01,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:01,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:01,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:01,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1105904855, now seen corresponding path program 1 times [2024-11-08 17:36:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:36:01,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923727367] [2024-11-08 17:36:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:01,896 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-08 17:36:01,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:36:01,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:01,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:36:02,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:36:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 17:36:02,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:36:02,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:36:02,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923727367] [2024-11-08 17:36:02,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923727367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:02,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:02,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:36:02,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144109252] [2024-11-08 17:36:02,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:02,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:36:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:36:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:36:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:36:02,651 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:36:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:02,757 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-08 17:36:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:36:02,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-08 17:36:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:02,765 INFO L225 Difference]: With dead ends: 269 [2024-11-08 17:36:02,769 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 17:36:02,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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-08 17:36:02,771 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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-08 17:36:02,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:36:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 17:36:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-08 17:36:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:36:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-08 17:36:02,802 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-08 17:36:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:02,803 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-08 17:36:02,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:36:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-08 17:36:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:36:02,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:02,810 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:36:02,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:03,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:03,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:03,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash -565475349, now seen corresponding path program 1 times [2024-11-08 17:36:03,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:36:03,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454712399] [2024-11-08 17:36:03,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:03,014 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-08 17:36:03,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:36:03,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:03,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:03,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:36:03,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:36:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-08 17:36:03,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:36:03,698 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:36:03,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454712399] [2024-11-08 17:36:03,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454712399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:03,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:03,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:36:03,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790605831] [2024-11-08 17:36:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:03,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:36:03,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:36:03,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:36:03,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:36:03,704 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:36:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:03,804 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2024-11-08 17:36:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:36:03,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-08 17:36:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:03,808 INFO L225 Difference]: With dead ends: 273 [2024-11-08 17:36:03,808 INFO L226 Difference]: Without dead ends: 139 [2024-11-08 17:36:03,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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-08 17:36:03,810 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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-08 17:36:03,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:36:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-08 17:36:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-08 17:36:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:36:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-08 17:36:03,826 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2024-11-08 17:36:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:03,827 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-08 17:36:03,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:36:03,828 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-08 17:36:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:36:03,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:03,834 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:36:03,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:04,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:04,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:04,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1036831699, now seen corresponding path program 1 times [2024-11-08 17:36:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:36:04,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459157107] [2024-11-08 17:36:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:04,041 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-08 17:36:04,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:36:04,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:04,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:04,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:36:04,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:36:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:36:04,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:36:04,646 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:36:04,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459157107] [2024-11-08 17:36:04,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459157107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:04,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:04,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:36:04,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677831524] [2024-11-08 17:36:04,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:04,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:36:04,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:36:04,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:36:04,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:36:04,649 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:36:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:04,709 INFO L93 Difference]: Finished difference Result 277 states and 404 transitions. [2024-11-08 17:36:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:36:04,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-08 17:36:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:04,712 INFO L225 Difference]: With dead ends: 277 [2024-11-08 17:36:04,712 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 17:36:04,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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-08 17:36:04,714 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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-08 17:36:04,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:36:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 17:36:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-08 17:36:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:36:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-08 17:36:04,727 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 156 [2024-11-08 17:36:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:04,728 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-08 17:36:04,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:36:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-08 17:36:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:36:04,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:04,731 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:36:04,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 17:36:04,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:04,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:04,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:04,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1106398840, now seen corresponding path program 1 times [2024-11-08 17:36:04,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:36:04,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082156380] [2024-11-08 17:36:04,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:04,942 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-08 17:36:04,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:36:04,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:04,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:05,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:36:05,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:36:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:36:05,548 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:36:05,549 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:36:05,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082156380] [2024-11-08 17:36:05,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082156380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:05,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:05,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:36:05,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191477643] [2024-11-08 17:36:05,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:05,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:36:05,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:36:05,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:36:05,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:36:05,552 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:36:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:05,610 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2024-11-08 17:36:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:36:05,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:36:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:05,613 INFO L225 Difference]: With dead ends: 282 [2024-11-08 17:36:05,614 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 17:36:05,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 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-08 17:36:05,615 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:36:05,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:36:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 17:36:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-08 17:36:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:36:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-08 17:36:05,627 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2024-11-08 17:36:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:05,628 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-08 17:36:05,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:36:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-08 17:36:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:36:05,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:05,631 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:36:05,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 17:36:05,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:05,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:05,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:05,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1693204854, now seen corresponding path program 1 times [2024-11-08 17:36:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:36:05,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158546738] [2024-11-08 17:36:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:05,833 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-08 17:36:05,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:36:05,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:05,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:06,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:36:06,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:36:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:36:06,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:36:06,578 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:36:06,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158546738] [2024-11-08 17:36:06,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158546738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:06,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:06,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:36:06,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656737443] [2024-11-08 17:36:06,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:06,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:36:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:36:06,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:36:06,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:36:06,584 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:36:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:06,713 INFO L93 Difference]: Finished difference Result 288 states and 416 transitions. [2024-11-08 17:36:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:36:06,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:36:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:06,718 INFO L225 Difference]: With dead ends: 288 [2024-11-08 17:36:06,718 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 17:36:06,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:36:06,724 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:36:06,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 935 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:36:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 17:36:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-08 17:36:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:36:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2024-11-08 17:36:06,746 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 158 [2024-11-08 17:36:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:06,747 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2024-11-08 17:36:06,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:36:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2024-11-08 17:36:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:36:06,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:06,749 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:36:06,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:06,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:06,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:06,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1013146484, now seen corresponding path program 1 times [2024-11-08 17:36:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:36:06,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109018855] [2024-11-08 17:36:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:06,951 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-08 17:36:06,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:36:06,955 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:06,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:07,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:36:07,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:36:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:36:07,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:36:07,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:36:07,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109018855] [2024-11-08 17:36:07,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109018855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:07,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:07,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:36:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058260392] [2024-11-08 17:36:07,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:07,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:36:07,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:36:07,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:36:07,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:36:07,586 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:36:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:07,726 INFO L93 Difference]: Finished difference Result 294 states and 421 transitions. [2024-11-08 17:36:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:36:07,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:36:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:07,728 INFO L225 Difference]: With dead ends: 294 [2024-11-08 17:36:07,728 INFO L226 Difference]: Without dead ends: 150 [2024-11-08 17:36:07,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:36:07,730 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:36:07,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1110 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:36:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-08 17:36:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2024-11-08 17:36:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 129 states have internal predecessors, (176), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:36:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 212 transitions. [2024-11-08 17:36:07,739 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 212 transitions. Word has length 158 [2024-11-08 17:36:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:07,740 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 212 transitions. [2024-11-08 17:36:07,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:36:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 212 transitions. [2024-11-08 17:36:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:36:07,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:07,743 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:36:07,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:07,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:07,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:07,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash 761860878, now seen corresponding path program 1 times [2024-11-08 17:36:07,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:36:07,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843761934] [2024-11-08 17:36:07,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:07,946 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-08 17:36:07,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:36:07,949 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:07,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:08,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 17:36:08,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:36:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:36:08,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:36:08,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:36:08,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843761934] [2024-11-08 17:36:08,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843761934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:08,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:08,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:36:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707313671] [2024-11-08 17:36:08,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:08,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:36:08,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:36:08,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:36:08,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:36:08,704 INFO L87 Difference]: Start difference. First operand 149 states and 212 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:36:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:08,872 INFO L93 Difference]: Finished difference Result 298 states and 425 transitions. [2024-11-08 17:36:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:36:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:36:08,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:08,875 INFO L225 Difference]: With dead ends: 298 [2024-11-08 17:36:08,875 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 17:36:08,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:36:08,877 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:36:08,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1287 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:36:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 17:36:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2024-11-08 17:36:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 131 states have (on average 1.3587786259541985) internal successors, (178), 131 states have internal predecessors, (178), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:36:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 214 transitions. [2024-11-08 17:36:08,888 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 214 transitions. Word has length 158 [2024-11-08 17:36:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:08,888 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 214 transitions. [2024-11-08 17:36:08,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:36:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 214 transitions. [2024-11-08 17:36:08,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:36:08,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:08,891 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:36:08,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:09,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:09,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:09,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash 763707920, now seen corresponding path program 1 times [2024-11-08 17:36:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:36:09,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297398597] [2024-11-08 17:36:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:09,094 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-08 17:36:09,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:36:09,097 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:09,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:09,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 17:36:09,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:36:10,000 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-08 17:36:10,127 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-08 17:36:10,183 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-08 17:36:10,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-08 17:36:10,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:36:10,523 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-08 17:36:10,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:36:10,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-08 17:36:11,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:36:11,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-08 17:36:11,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:36:11,447 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-08 17:36:11,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:36:11,899 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 98 treesize of output 76 [2024-11-08 17:36:12,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:36:12,507 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 97 treesize of output 93 [2024-11-08 17:36:12,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:36:12,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 115 treesize of output 49 [2024-11-08 17:36:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 465 proven. 39 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-08 17:36:13,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:36:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:36:13,710 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:36:13,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297398597] [2024-11-08 17:36:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297398597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:36:13,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:36:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2024-11-08 17:36:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158386478] [2024-11-08 17:36:13,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:36:13,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:36:13,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:36:13,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:36:13,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:36:13,716 INFO L87 Difference]: Start difference. First operand 151 states and 214 transitions. Second operand has 16 states, 14 states have (on average 8.285714285714286) internal successors, (116), 16 states have internal predecessors, (116), 7 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 7 states have call successors, (32) [2024-11-08 17:36:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:23,372 INFO L93 Difference]: Finished difference Result 408 states and 560 transitions. [2024-11-08 17:36:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 17:36:23,374 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.285714285714286) internal successors, (116), 16 states have internal predecessors, (116), 7 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 7 states have call successors, (32) Word has length 158 [2024-11-08 17:36:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:23,376 INFO L225 Difference]: With dead ends: 408 [2024-11-08 17:36:23,377 INFO L226 Difference]: Without dead ends: 260 [2024-11-08 17:36:23,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=405, Invalid=1155, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 17:36:23,380 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 841 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:36:23,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 507 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-08 17:36:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-08 17:36:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 171. [2024-11-08 17:36:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 146 states have internal predecessors, (192), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:36:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 228 transitions. [2024-11-08 17:36:23,404 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 228 transitions. Word has length 158 [2024-11-08 17:36:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:23,405 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 228 transitions. [2024-11-08 17:36:23,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 8.285714285714286) internal successors, (116), 16 states have internal predecessors, (116), 7 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 7 states have call successors, (32) [2024-11-08 17:36:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 228 transitions. [2024-11-08 17:36:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:36:23,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:23,412 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:36:23,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-08 17:36:23,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:23,613 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:23,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:23,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1230436786, now seen corresponding path program 1 times [2024-11-08 17:36:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:36:23,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146514026] [2024-11-08 17:36:23,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:23,614 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-08 17:36:23,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:36:23,617 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:23,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:36:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:24,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 17:36:24,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:36:24,389 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 105 treesize of output 104 [2024-11-08 17:36:24,681 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 154 treesize of output 139 [2024-11-08 17:36:25,179 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 154 treesize of output 139 [2024-11-08 17:36:25,595 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 154 treesize of output 139 [2024-11-08 17:36:26,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 139 [2024-11-08 17:36:27,964 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 170 treesize of output 151 [2024-11-08 17:36:29,116 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 170 treesize of output 151 [2024-11-08 17:36:30,261 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 171 treesize of output 150 [2024-11-08 17:36:31,309 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 176 treesize of output 155 [2024-11-08 17:36:32,421 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 181 treesize of output 158 [2024-11-08 17:36:33,743 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 176 treesize of output 153 [2024-11-08 17:36:35,028 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 181 treesize of output 158 [2024-11-08 17:36:36,544 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 223 treesize of output 194 [2024-11-08 17:36:38,001 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 208 treesize of output 175 [2024-11-08 17:36:38,948 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 227 treesize of output 193 [2024-11-08 17:36:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 8 proven. 551 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-08 17:36:39,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:36:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:36:43,393 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:36:43,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146514026] [2024-11-08 17:36:43,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146514026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:36:43,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:36:43,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2024-11-08 17:36:43,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133941926] [2024-11-08 17:36:43,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:36:43,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 17:36:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:36:43,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 17:36:43,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2024-11-08 17:36:43,396 INFO L87 Difference]: Start difference. First operand 171 states and 228 transitions. Second operand has 27 states, 25 states have (on average 6.16) internal successors, (154), 27 states have internal predecessors, (154), 13 states have call successors, (36), 9 states have call predecessors, (36), 11 states have return successors, (36), 11 states have call predecessors, (36), 13 states have call successors, (36) [2024-11-08 17:37:11,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:12,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:15,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:17,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:23,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:25,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:30,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:32,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:42,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:45,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:47,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:52,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:53,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:37:56,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:00,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:01,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:03,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:06,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:12,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:20,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:22,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:25,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:29,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:33,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:39,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:40,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:41,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:44,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:54,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:38:56,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:01,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:05,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:09,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:13,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:14,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:17,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:19,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:21,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:22,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:33,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:34,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:35,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:45,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:49,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:53,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:39:58,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:00,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:04,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:07,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:09,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:11,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:16,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:23,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:24,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:29,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:33,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:37,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:41,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:45,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:47,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:54,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:57,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:40:59,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:04,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:06,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:10,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:12,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:16,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:17,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:20,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:22,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:27,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:28,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:56,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:41:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:41:57,645 INFO L93 Difference]: Finished difference Result 716 states and 953 transitions. [2024-11-08 17:41:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-08 17:41:57,646 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 6.16) internal successors, (154), 27 states have internal predecessors, (154), 13 states have call successors, (36), 9 states have call predecessors, (36), 11 states have return successors, (36), 11 states have call predecessors, (36), 13 states have call successors, (36) Word has length 158 [2024-11-08 17:41:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:41:57,650 INFO L225 Difference]: With dead ends: 716 [2024-11-08 17:41:57,650 INFO L226 Difference]: Without dead ends: 548 [2024-11-08 17:41:57,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 286 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=493, Invalid=1399, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 17:41:57,652 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1280 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 228 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 296.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 306.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:41:57,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 1521 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 2489 Invalid, 13 Unknown, 0 Unchecked, 306.3s Time] [2024-11-08 17:41:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-08 17:41:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 416. [2024-11-08 17:41:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 344 states have (on average 1.2965116279069768) internal successors, (446), 345 states have internal predecessors, (446), 52 states have call successors, (52), 19 states have call predecessors, (52), 19 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 17:41:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 550 transitions. [2024-11-08 17:41:57,725 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 550 transitions. Word has length 158 [2024-11-08 17:41:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:41:57,726 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 550 transitions. [2024-11-08 17:41:57,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 6.16) internal successors, (154), 27 states have internal predecessors, (154), 13 states have call successors, (36), 9 states have call predecessors, (36), 11 states have return successors, (36), 11 states have call predecessors, (36), 13 states have call successors, (36) [2024-11-08 17:41:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 550 transitions. [2024-11-08 17:41:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:41:57,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:41:57,729 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:41:57,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-08 17:41:57,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:41:57,929 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:41:57,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:41:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash 656873939, now seen corresponding path program 1 times [2024-11-08 17:41:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:41:57,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342545141] [2024-11-08 17:41:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:41:57,931 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-08 17:41:57,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:41:57,932 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:41:57,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:41:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:41:58,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 17:41:58,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:41:58,679 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-08 17:41:59,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-08 17:41:59,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-08 17:41:59,647 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-08 17:42:00,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:00,106 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-08 17:42:00,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:00,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 55 [2024-11-08 17:42:01,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:01,568 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-08 17:42:02,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:02,803 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-08 17:42:04,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:04,002 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 117 treesize of output 101 [2024-11-08 17:42:04,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:04,551 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 112 treesize of output 52 [2024-11-08 17:42:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 528 proven. 39 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-08 17:42:04,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:42:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:42:05,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:42:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342545141] [2024-11-08 17:42:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342545141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:42:05,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:42:05,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 19 [2024-11-08 17:42:05,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955164395] [2024-11-08 17:42:05,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:42:05,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:42:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:42:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:42:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:42:05,965 INFO L87 Difference]: Start difference. First operand 416 states and 550 transitions. Second operand has 19 states, 17 states have (on average 7.235294117647059) internal successors, (123), 19 states have internal predecessors, (123), 11 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (33), 9 states have call predecessors, (33), 11 states have call successors, (33) [2024-11-08 17:42:08,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:42:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:42:19,663 INFO L93 Difference]: Finished difference Result 616 states and 802 transitions. [2024-11-08 17:42:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 17:42:19,665 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.235294117647059) internal successors, (123), 19 states have internal predecessors, (123), 11 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (33), 9 states have call predecessors, (33), 11 states have call successors, (33) Word has length 160 [2024-11-08 17:42:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:42:19,669 INFO L225 Difference]: With dead ends: 616 [2024-11-08 17:42:19,669 INFO L226 Difference]: Without dead ends: 448 [2024-11-08 17:42:19,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=597, Invalid=1565, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 17:42:19,671 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 652 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:42:19,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 363 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2024-11-08 17:42:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-08 17:42:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 404. [2024-11-08 17:42:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 339 states have (on average 1.2979351032448379) internal successors, (440), 340 states have internal predecessors, (440), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 17:42:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 528 transitions. [2024-11-08 17:42:19,761 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 528 transitions. Word has length 160 [2024-11-08 17:42:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:42:19,761 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 528 transitions. [2024-11-08 17:42:19,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.235294117647059) internal successors, (123), 19 states have internal predecessors, (123), 11 states have call successors, (33), 8 states have call predecessors, (33), 10 states have return successors, (33), 9 states have call predecessors, (33), 11 states have call successors, (33) [2024-11-08 17:42:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 528 transitions. [2024-11-08 17:42:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:42:19,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:42:19,766 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:42:19,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:19,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:19,966 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:42:19,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:42:19,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1358473813, now seen corresponding path program 1 times [2024-11-08 17:42:19,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:42:19,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297206386] [2024-11-08 17:42:19,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:42:19,967 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-08 17:42:19,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:42:19,968 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:19,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:42:20,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 17:42:20,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:42:20,711 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-08 17:42:21,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-08 17:42:21,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-08 17:42:21,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-08 17:42:21,874 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-08 17:42:22,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:22,308 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 51 treesize of output 32 [2024-11-08 17:42:22,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:22,836 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-08 17:42:23,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:23,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 55 [2024-11-08 17:42:24,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:24,230 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 97 treesize of output 84 [2024-11-08 17:42:25,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:25,097 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 82 treesize of output 99 [2024-11-08 17:42:26,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:26,059 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 99 treesize of output 113 [2024-11-08 17:42:26,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:26,841 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 132 treesize of output 58 [2024-11-08 17:42:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 488 proven. 39 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 17:42:27,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:42:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:42:28,718 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:42:28,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297206386] [2024-11-08 17:42:28,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297206386] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:42:28,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:42:28,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 21 [2024-11-08 17:42:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576276067] [2024-11-08 17:42:28,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:42:28,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:42:28,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:42:28,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:42:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:42:28,721 INFO L87 Difference]: Start difference. First operand 404 states and 528 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:42:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:42:37,307 INFO L93 Difference]: Finished difference Result 793 states and 1028 transitions. [2024-11-08 17:42:37,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:42:37,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-08 17:42:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:42:37,311 INFO L225 Difference]: With dead ends: 793 [2024-11-08 17:42:37,311 INFO L226 Difference]: Without dead ends: 617 [2024-11-08 17:42:37,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:42:37,313 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 163 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:42:37,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 906 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-08 17:42:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-08 17:42:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 430. [2024-11-08 17:42:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 365 states have (on average 1.3123287671232877) internal successors, (479), 366 states have internal predecessors, (479), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 17:42:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 567 transitions. [2024-11-08 17:42:37,388 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 567 transitions. Word has length 160 [2024-11-08 17:42:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:42:37,389 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 567 transitions. [2024-11-08 17:42:37,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:42:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 567 transitions. [2024-11-08 17:42:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:42:37,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:42:37,391 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:42:37,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:37,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:37,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:42:37,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:42:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash -348234457, now seen corresponding path program 1 times [2024-11-08 17:42:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:42:37,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339688818] [2024-11-08 17:42:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:42:37,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:42:37,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:42:37,594 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:37,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:42:38,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 17:42:38,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:42:38,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 17:42:38,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:38,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 59 [2024-11-08 17:42:38,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:38,823 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 71 treesize of output 79 [2024-11-08 17:42:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:42:39,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:42:39,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:42:39,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339688818] [2024-11-08 17:42:39,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339688818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:42:39,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:42:39,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:42:39,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140961939] [2024-11-08 17:42:39,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:42:39,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:42:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:42:39,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:42:39,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:42:39,577 INFO L87 Difference]: Start difference. First operand 430 states and 567 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:42:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:42:47,057 INFO L93 Difference]: Finished difference Result 970 states and 1290 transitions. [2024-11-08 17:42:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:42:47,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-08 17:42:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:42:47,061 INFO L225 Difference]: With dead ends: 970 [2024-11-08 17:42:47,061 INFO L226 Difference]: Without dead ends: 600 [2024-11-08 17:42:47,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:42:47,063 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 210 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:42:47,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 626 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-08 17:42:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-08 17:42:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 430. [2024-11-08 17:42:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 365 states have (on average 1.3068493150684932) internal successors, (477), 366 states have internal predecessors, (477), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 17:42:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 565 transitions. [2024-11-08 17:42:47,177 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 565 transitions. Word has length 160 [2024-11-08 17:42:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:42:47,177 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 565 transitions. [2024-11-08 17:42:47,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:42:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 565 transitions. [2024-11-08 17:42:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:42:47,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:42:47,179 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:42:47,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:47,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:47,380 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:42:47,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:42:47,380 INFO L85 PathProgramCache]: Analyzing trace with hash -935040471, now seen corresponding path program 1 times [2024-11-08 17:42:47,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:42:47,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535747609] [2024-11-08 17:42:47,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:42:47,382 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-08 17:42:47,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:42:47,385 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:47,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:42:48,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 17:42:48,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:42:48,124 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-08 17:42:48,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2024-11-08 17:42:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:42:48,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:42:48,353 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:42:48,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535747609] [2024-11-08 17:42:48,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535747609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:42:48,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:42:48,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:42:48,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079505465] [2024-11-08 17:42:48,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:42:48,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:42:48,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:42:48,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:42:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:42:48,355 INFO L87 Difference]: Start difference. First operand 430 states and 565 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:42:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:42:53,998 INFO L93 Difference]: Finished difference Result 1108 states and 1446 transitions. [2024-11-08 17:42:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:42:53,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-08 17:42:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:42:54,005 INFO L225 Difference]: With dead ends: 1108 [2024-11-08 17:42:54,005 INFO L226 Difference]: Without dead ends: 738 [2024-11-08 17:42:54,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 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-08 17:42:54,007 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 138 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:42:54,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 973 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-08 17:42:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-08 17:42:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 466. [2024-11-08 17:42:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 401 states have (on average 1.3067331670822944) internal successors, (524), 402 states have internal predecessors, (524), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 17:42:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 612 transitions. [2024-11-08 17:42:54,117 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 612 transitions. Word has length 160 [2024-11-08 17:42:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:42:54,117 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 612 transitions. [2024-11-08 17:42:54,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:42:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 612 transitions. [2024-11-08 17:42:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:42:54,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:42:54,119 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:42:54,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-08 17:42:54,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:54,320 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:42:54,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:42:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash 549667165, now seen corresponding path program 1 times [2024-11-08 17:42:54,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:42:54,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125307827] [2024-11-08 17:42:54,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:42:54,321 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-08 17:42:54,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:42:54,322 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:54,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:42:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:42:55,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 17:42:55,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:42:55,145 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-08 17:42:55,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-08 17:42:55,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-08 17:42:55,961 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-08 17:42:56,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:56,445 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 51 treesize of output 32 [2024-11-08 17:42:56,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:56,931 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 51 treesize of output 32 [2024-11-08 17:42:57,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:57,303 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 51 treesize of output 32 [2024-11-08 17:42:57,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:57,743 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 51 treesize of output 32 [2024-11-08 17:42:58,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:58,228 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 88 treesize of output 54 [2024-11-08 17:42:58,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:42:58,902 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 82 treesize of output 72 [2024-11-08 17:43:00,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:00,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 123 treesize of output 51 [2024-11-08 17:43:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 368 proven. 39 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-11-08 17:43:01,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:43:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:43:02,015 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:43:02,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125307827] [2024-11-08 17:43:02,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125307827] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:43:02,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:43:02,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2024-11-08 17:43:02,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97868611] [2024-11-08 17:43:02,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:02,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:43:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:43:02,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:43:02,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:43:02,018 INFO L87 Difference]: Start difference. First operand 466 states and 612 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:43:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:05,987 INFO L93 Difference]: Finished difference Result 474 states and 621 transitions. [2024-11-08 17:43:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:43:05,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-08 17:43:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:05,991 INFO L225 Difference]: With dead ends: 474 [2024-11-08 17:43:05,991 INFO L226 Difference]: Without dead ends: 472 [2024-11-08 17:43:05,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 307 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:43:05,992 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 105 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:05,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 487 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-08 17:43:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-08 17:43:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2024-11-08 17:43:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 407 states have (on average 1.3022113022113022) internal successors, (530), 408 states have internal predecessors, (530), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 17:43:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 618 transitions. [2024-11-08 17:43:06,097 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 618 transitions. Word has length 163 [2024-11-08 17:43:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:06,098 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 618 transitions. [2024-11-08 17:43:06,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:43:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 618 transitions. [2024-11-08 17:43:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:43:06,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:06,099 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:43:06,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:43:06,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:43:06,300 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:06,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash 551514207, now seen corresponding path program 1 times [2024-11-08 17:43:06,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:43:06,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999340449] [2024-11-08 17:43:06,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:06,301 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-08 17:43:06,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:43:06,302 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:43:06,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:43:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:07,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 17:43:07,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:43:07,304 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-08 17:43:07,949 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 34 [2024-11-08 17:43:08,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:08,632 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 110 treesize of output 55 [2024-11-08 17:43:08,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:08,937 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 105 treesize of output 65 [2024-11-08 17:43:09,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:09,611 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 120 treesize of output 68 [2024-11-08 17:43:10,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:10,044 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 120 treesize of output 68 [2024-11-08 17:43:10,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:10,590 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 115 treesize of output 78 [2024-11-08 17:43:11,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:11,458 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 125 treesize of output 91 [2024-11-08 17:43:12,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:12,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 140 treesize of output 94 [2024-11-08 17:43:13,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:13,357 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 135 treesize of output 104 [2024-11-08 17:43:14,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:14,545 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 145 treesize of output 117 [2024-11-08 17:43:16,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:16,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 197 treesize of output 142 [2024-11-08 17:43:18,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:18,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 243 treesize of output 176 [2024-11-08 17:43:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 464 proven. 68 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-08 17:43:20,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:43:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:43:21,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:43:21,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999340449] [2024-11-08 17:43:21,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999340449] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:43:21,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:43:21,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2024-11-08 17:43:21,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638673606] [2024-11-08 17:43:21,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:21,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:43:21,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:43:21,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:43:21,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-11-08 17:43:21,953 INFO L87 Difference]: Start difference. First operand 472 states and 618 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:43:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:43:28,429 INFO L93 Difference]: Finished difference Result 1075 states and 1418 transitions. [2024-11-08 17:43:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:43:28,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-08 17:43:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:43:28,434 INFO L225 Difference]: With dead ends: 1075 [2024-11-08 17:43:28,434 INFO L226 Difference]: Without dead ends: 663 [2024-11-08 17:43:28,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:43:28,436 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 148 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:43:28,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 380 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-08 17:43:28,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-08 17:43:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 557. [2024-11-08 17:43:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 492 states have (on average 1.315040650406504) internal successors, (647), 493 states have internal predecessors, (647), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 17:43:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 735 transitions. [2024-11-08 17:43:28,550 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 735 transitions. Word has length 163 [2024-11-08 17:43:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:43:28,550 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 735 transitions. [2024-11-08 17:43:28,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:43:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 735 transitions. [2024-11-08 17:43:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:43:28,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:43:28,553 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:43:28,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-08 17:43:28,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:43:28,754 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:43:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:43:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash 974216033, now seen corresponding path program 1 times [2024-11-08 17:43:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:43:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763335] [2024-11-08 17:43:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:43:28,755 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-08 17:43:28,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:43:28,756 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:43:28,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:43:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:43:29,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 17:43:29,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:43:29,759 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-08 17:43:30,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-08 17:43:31,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:31,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2024-11-08 17:43:32,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 67 [2024-11-08 17:43:34,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:34,825 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 200 treesize of output 100 [2024-11-08 17:43:35,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:35,913 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 195 treesize of output 110 [2024-11-08 17:43:37,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:37,560 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 205 treesize of output 123 [2024-11-08 17:43:39,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:39,490 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 215 treesize of output 136 [2024-11-08 17:43:41,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:41,678 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 230 treesize of output 139 [2024-11-08 17:43:43,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:43,449 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 225 treesize of output 149 [2024-11-08 17:43:45,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:45,936 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 277 treesize of output 183 [2024-11-08 17:43:50,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:43:50,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 350 treesize of output 226 [2024-11-08 17:43:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 17:43:50,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:43:50,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:43:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763335] [2024-11-08 17:43:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:43:50,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:43:50,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-08 17:43:50,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970686397] [2024-11-08 17:43:50,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:43:50,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 17:43:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:43:50,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 17:43:50,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2024-11-08 17:43:50,981 INFO L87 Difference]: Start difference. First operand 557 states and 735 transitions. Second operand has 23 states, 23 states have (on average 4.217391304347826) internal successors, (97), 22 states have internal predecessors, (97), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-08 17:44:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:44:27,167 INFO L93 Difference]: Finished difference Result 2509 states and 3302 transitions. [2024-11-08 17:44:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 17:44:27,169 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.217391304347826) internal successors, (97), 22 states have internal predecessors, (97), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 163 [2024-11-08 17:44:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:44:27,177 INFO L225 Difference]: With dead ends: 2509 [2024-11-08 17:44:27,177 INFO L226 Difference]: Without dead ends: 2012 [2024-11-08 17:44:27,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:44:27,180 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 912 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 2465 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:44:27,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 1153 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2465 Invalid, 0 Unknown, 0 Unchecked, 35.3s Time] [2024-11-08 17:44:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2024-11-08 17:44:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 2000. [2024-11-08 17:44:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1765 states have (on average 1.311614730878187) internal successors, (2315), 1775 states have internal predecessors, (2315), 158 states have call successors, (158), 76 states have call predecessors, (158), 76 states have return successors, (158), 148 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-08 17:44:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2631 transitions. [2024-11-08 17:44:27,660 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2631 transitions. Word has length 163 [2024-11-08 17:44:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:44:27,662 INFO L471 AbstractCegarLoop]: Abstraction has 2000 states and 2631 transitions. [2024-11-08 17:44:27,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.217391304347826) internal successors, (97), 22 states have internal predecessors, (97), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-08 17:44:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2631 transitions. [2024-11-08 17:44:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:44:27,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:44:27,669 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:44:27,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:44:27,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:44:27,870 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:44:27,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:44:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash 528881953, now seen corresponding path program 1 times [2024-11-08 17:44:27,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:44:27,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092018096] [2024-11-08 17:44:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:44:27,871 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-08 17:44:27,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:44:27,873 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:44:27,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:44:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:44:28,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-08 17:44:28,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:44:29,096 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-08 17:44:29,971 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 34 [2024-11-08 17:44:30,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-08 17:44:32,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:44:32,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2024-11-08 17:44:33,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 67 [2024-11-08 17:44:36,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:44:36,191 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 200 treesize of output 100 [2024-11-08 17:44:37,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:44:37,465 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 200 treesize of output 100 [2024-11-08 17:44:38,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:44:38,726 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 195 treesize of output 110 [2024-11-08 17:44:40,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:44:40,619 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 210 treesize of output 113 [2024-11-08 17:44:41,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:44:42,000 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 210 treesize of output 113 [2024-11-08 17:44:43,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:44:43,687 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 205 treesize of output 123 [2024-11-08 17:44:46,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:44:46,056 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 257 treesize of output 166 [2024-11-08 17:44:49,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:44:49,899 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 343 treesize of output 127 [2024-11-08 17:44:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 17:44:51,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:44:51,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:44:51,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092018096] [2024-11-08 17:44:51,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092018096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:44:51,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:44:51,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 17:44:51,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138195363] [2024-11-08 17:44:51,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:44:51,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 17:44:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:44:51,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 17:44:51,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:44:51,103 INFO L87 Difference]: Start difference. First operand 2000 states and 2631 transitions. Second operand has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 20 states have internal predecessors, (88), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-08 17:45:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:36,781 INFO L93 Difference]: Finished difference Result 6685 states and 8787 transitions. [2024-11-08 17:45:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 17:45:36,782 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 20 states have internal predecessors, (88), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 163 [2024-11-08 17:45:36,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:36,799 INFO L225 Difference]: With dead ends: 6685 [2024-11-08 17:45:36,799 INFO L226 Difference]: Without dead ends: 4835 [2024-11-08 17:45:36,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2024-11-08 17:45:36,804 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 1009 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:45:36,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 991 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2496 Invalid, 0 Unknown, 0 Unchecked, 43.2s Time] [2024-11-08 17:45:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4835 states. [2024-11-08 17:45:37,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4835 to 2555. [2024-11-08 17:45:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2177 states have (on average 1.2949012402388609) internal successors, (2819), 2199 states have internal predecessors, (2819), 253 states have call successors, (253), 124 states have call predecessors, (253), 124 states have return successors, (253), 231 states have call predecessors, (253), 253 states have call successors, (253) [2024-11-08 17:45:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3325 transitions. [2024-11-08 17:45:37,517 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3325 transitions. Word has length 163 [2024-11-08 17:45:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:37,518 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 3325 transitions. [2024-11-08 17:45:37,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 20 states have internal predecessors, (88), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-08 17:45:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3325 transitions. [2024-11-08 17:45:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:45:37,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:37,523 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:45:37,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:45:37,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:45:37,723 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:37,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:37,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1384826399, now seen corresponding path program 1 times [2024-11-08 17:45:37,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:45:37,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759971148] [2024-11-08 17:45:37,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:37,725 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-08 17:45:37,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:45:37,726 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:45:37,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:45:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:38,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:45:38,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:45:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-08 17:45:38,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:45:38,398 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:45:38,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759971148] [2024-11-08 17:45:38,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759971148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:45:38,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:45:38,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:45:38,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147244544] [2024-11-08 17:45:38,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:45:38,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:45:38,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:45:38,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:45:38,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:45:38,400 INFO L87 Difference]: Start difference. First operand 2555 states and 3325 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:45:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:39,162 INFO L93 Difference]: Finished difference Result 4945 states and 6443 transitions. [2024-11-08 17:45:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:45:39,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2024-11-08 17:45:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:39,171 INFO L225 Difference]: With dead ends: 4945 [2024-11-08 17:45:39,172 INFO L226 Difference]: Without dead ends: 2561 [2024-11-08 17:45:39,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 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-08 17:45:39,176 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:45:39,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 574 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:45:39,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2024-11-08 17:45:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2561. [2024-11-08 17:45:39,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2183 states have (on average 1.2899679340357306) internal successors, (2816), 2205 states have internal predecessors, (2816), 253 states have call successors, (253), 124 states have call predecessors, (253), 124 states have return successors, (253), 231 states have call predecessors, (253), 253 states have call successors, (253) [2024-11-08 17:45:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3322 transitions. [2024-11-08 17:45:39,737 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3322 transitions. Word has length 163 [2024-11-08 17:45:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:39,738 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 3322 transitions. [2024-11-08 17:45:39,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:45:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3322 transitions. [2024-11-08 17:45:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:45:39,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:39,742 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:45:39,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-08 17:45:39,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:45:39,943 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:39,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:39,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1666346913, now seen corresponding path program 1 times [2024-11-08 17:45:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:45:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235191217] [2024-11-08 17:45:39,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:39,946 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-08 17:45:39,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:45:39,949 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:45:39,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:45:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:40,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:45:40,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:45:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:45:40,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:45:40,779 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:45:40,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235191217] [2024-11-08 17:45:40,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235191217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:45:40,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:45:40,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:45:40,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549450136] [2024-11-08 17:45:40,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:45:40,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:45:40,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:45:40,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:45:40,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:45:40,782 INFO L87 Difference]: Start difference. First operand 2561 states and 3322 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:45:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:41,467 INFO L93 Difference]: Finished difference Result 5013 states and 6511 transitions. [2024-11-08 17:45:41,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:45:41,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-08 17:45:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:41,481 INFO L225 Difference]: With dead ends: 5013 [2024-11-08 17:45:41,481 INFO L226 Difference]: Without dead ends: 2561 [2024-11-08 17:45:41,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:45:41,488 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:45:41,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:45:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2024-11-08 17:45:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2561. [2024-11-08 17:45:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2183 states have (on average 1.2858451672010993) internal successors, (2807), 2205 states have internal predecessors, (2807), 253 states have call successors, (253), 124 states have call predecessors, (253), 124 states have return successors, (253), 231 states have call predecessors, (253), 253 states have call successors, (253) [2024-11-08 17:45:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3313 transitions. [2024-11-08 17:45:42,203 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3313 transitions. Word has length 163 [2024-11-08 17:45:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:42,203 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 3313 transitions. [2024-11-08 17:45:42,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:45:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3313 transitions. [2024-11-08 17:45:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 17:45:42,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:42,208 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:45:42,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-08 17:45:42,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:45:42,409 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:42,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash 357917897, now seen corresponding path program 1 times [2024-11-08 17:45:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:45:42,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292930939] [2024-11-08 17:45:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:42,411 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-08 17:45:42,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:45:42,413 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:45:42,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-08 17:45:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:43,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 17:45:43,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:45:43,505 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 97 treesize of output 43 [2024-11-08 17:45:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 128 proven. 4 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:45:43,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:45:44,585 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 61 treesize of output 25 [2024-11-08 17:45:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:45:44,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:45:44,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292930939] [2024-11-08 17:45:44,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292930939] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:45:44,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:45:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-08 17:45:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378771599] [2024-11-08 17:45:44,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:45:44,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:45:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:45:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:45:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:45:44,620 INFO L87 Difference]: Start difference. First operand 2561 states and 3313 transitions. Second operand has 12 states, 11 states have (on average 9.272727272727273) internal successors, (102), 12 states have internal predecessors, (102), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-08 17:45:47,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:45:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:45:56,635 INFO L93 Difference]: Finished difference Result 5076 states and 6556 transitions. [2024-11-08 17:45:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:45:56,643 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.272727272727273) internal successors, (102), 12 states have internal predecessors, (102), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) Word has length 165 [2024-11-08 17:45:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:45:56,651 INFO L225 Difference]: With dead ends: 5076 [2024-11-08 17:45:56,651 INFO L226 Difference]: Without dead ends: 2615 [2024-11-08 17:45:56,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:45:56,657 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 172 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:45:56,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 790 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-11-08 17:45:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2024-11-08 17:45:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 2549. [2024-11-08 17:45:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 2171 states have (on average 1.2818977429755873) internal successors, (2783), 2193 states have internal predecessors, (2783), 253 states have call successors, (253), 124 states have call predecessors, (253), 124 states have return successors, (253), 231 states have call predecessors, (253), 253 states have call successors, (253) [2024-11-08 17:45:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3289 transitions. [2024-11-08 17:45:57,381 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3289 transitions. Word has length 165 [2024-11-08 17:45:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:45:57,382 INFO L471 AbstractCegarLoop]: Abstraction has 2549 states and 3289 transitions. [2024-11-08 17:45:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.272727272727273) internal successors, (102), 12 states have internal predecessors, (102), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-08 17:45:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3289 transitions. [2024-11-08 17:45:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 17:45:57,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:45:57,388 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:45:57,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-08 17:45:57,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:45:57,589 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:45:57,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:45:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1653400265, now seen corresponding path program 1 times [2024-11-08 17:45:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:45:57,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578564533] [2024-11-08 17:45:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:45:57,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-08 17:45:57,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:45:57,592 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:45:57,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-08 17:45:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:45:58,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 17:45:58,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:45:58,943 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 97 treesize of output 43 [2024-11-08 17:45:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 20 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-08 17:45:59,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:45:59,994 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 61 treesize of output 25 [2024-11-08 17:46:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 36 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:46:00,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578564533] [2024-11-08 17:46:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578564533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:46:00,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:46:00,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-08 17:46:00,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959810277] [2024-11-08 17:46:00,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:46:00,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:46:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:46:00,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:46:00,101 INFO L87 Difference]: Start difference. First operand 2549 states and 3289 transitions. Second operand has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 12 states have internal predecessors, (112), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-08 17:46:01,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:46:02,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:46:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:11,178 INFO L93 Difference]: Finished difference Result 5022 states and 6476 transitions. [2024-11-08 17:46:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:46:11,187 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 12 states have internal predecessors, (112), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) Word has length 165 [2024-11-08 17:46:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:11,195 INFO L225 Difference]: With dead ends: 5022 [2024-11-08 17:46:11,195 INFO L226 Difference]: Without dead ends: 2597 [2024-11-08 17:46:11,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:46:11,201 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 168 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:11,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 666 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-08 17:46:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-11-08 17:46:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2531. [2024-11-08 17:46:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2153 states have (on average 1.2731072921504878) internal successors, (2741), 2175 states have internal predecessors, (2741), 253 states have call successors, (253), 124 states have call predecessors, (253), 124 states have return successors, (253), 231 states have call predecessors, (253), 253 states have call successors, (253) [2024-11-08 17:46:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3247 transitions. [2024-11-08 17:46:11,846 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3247 transitions. Word has length 165 [2024-11-08 17:46:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:11,846 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 3247 transitions. [2024-11-08 17:46:11,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.181818181818182) internal successors, (112), 12 states have internal predecessors, (112), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-08 17:46:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3247 transitions. [2024-11-08 17:46:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 17:46:11,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:11,850 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:46:11,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-08 17:46:12,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:46:12,051 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:12,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1165353159, now seen corresponding path program 1 times [2024-11-08 17:46:12,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:12,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050452156] [2024-11-08 17:46:12,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:12,052 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-08 17:46:12,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:12,056 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:46:12,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-08 17:46:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:12,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 17:46:12,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:13,014 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-08 17:46:13,614 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-08 17:46:13,868 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-08 17:46:14,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:14,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2024-11-08 17:46:14,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:14,906 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-08 17:46:15,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:15,642 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 99 treesize of output 77 [2024-11-08 17:46:16,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:16,616 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 98 treesize of output 94 [2024-11-08 17:46:18,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:18,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 139 treesize of output 55 [2024-11-08 17:46:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 412 proven. 48 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-08 17:46:19,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:46:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:46:19,878 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:19,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050452156] [2024-11-08 17:46:19,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050452156] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:46:19,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:46:19,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 17 [2024-11-08 17:46:19,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813293250] [2024-11-08 17:46:19,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:19,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:46:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:19,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:46:19,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:46:19,880 INFO L87 Difference]: Start difference. First operand 2531 states and 3247 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:46:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:24,185 INFO L93 Difference]: Finished difference Result 4821 states and 6214 transitions. [2024-11-08 17:46:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:46:24,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 165 [2024-11-08 17:46:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:24,206 INFO L225 Difference]: With dead ends: 4821 [2024-11-08 17:46:24,206 INFO L226 Difference]: Without dead ends: 2531 [2024-11-08 17:46:24,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:46:24,212 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 120 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:24,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 327 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 17:46:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-11-08 17:46:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2531. [2024-11-08 17:46:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2153 states have (on average 1.2693915466790524) internal successors, (2733), 2175 states have internal predecessors, (2733), 253 states have call successors, (253), 124 states have call predecessors, (253), 124 states have return successors, (253), 231 states have call predecessors, (253), 253 states have call successors, (253) [2024-11-08 17:46:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3239 transitions. [2024-11-08 17:46:24,953 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3239 transitions. Word has length 165 [2024-11-08 17:46:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:24,954 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 3239 transitions. [2024-11-08 17:46:24,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:46:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3239 transitions. [2024-11-08 17:46:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 17:46:24,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:24,959 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:46:24,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-08 17:46:25,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:46:25,159 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:25,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:25,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1354606775, now seen corresponding path program 1 times [2024-11-08 17:46:25,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:25,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404770843] [2024-11-08 17:46:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:25,161 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-08 17:46:25,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:25,164 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:46:25,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-08 17:46:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:26,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 17:46:26,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:26,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,186 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:46:26,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,219 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:46:26,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:46:26,269 INFO L224 Elim1Store]: Index analysis took 110 ms [2024-11-08 17:46:26,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 109 [2024-11-08 17:46:27,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:27,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 119 treesize of output 47 [2024-11-08 17:46:28,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:28,316 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 51 treesize of output 51 [2024-11-08 17:46:28,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:28,948 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 71 [2024-11-08 17:46:30,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:30,428 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 101 treesize of output 47 [2024-11-08 17:46:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:46:30,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:30,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:30,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404770843] [2024-11-08 17:46:30,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404770843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:30,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:30,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:46:30,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885552419] [2024-11-08 17:46:30,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:30,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:46:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:30,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:46:30,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:46:30,577 INFO L87 Difference]: Start difference. First operand 2531 states and 3239 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:46:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:43,030 INFO L93 Difference]: Finished difference Result 5445 states and 6995 transitions. [2024-11-08 17:46:43,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:46:43,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 165 [2024-11-08 17:46:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:43,048 INFO L225 Difference]: With dead ends: 5445 [2024-11-08 17:46:43,048 INFO L226 Difference]: Without dead ends: 3155 [2024-11-08 17:46:43,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:46:43,054 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 381 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:43,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 640 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-08 17:46:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2024-11-08 17:46:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 2531. [2024-11-08 17:46:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2153 states have (on average 1.2656758012076172) internal successors, (2725), 2175 states have internal predecessors, (2725), 253 states have call successors, (253), 124 states have call predecessors, (253), 124 states have return successors, (253), 231 states have call predecessors, (253), 253 states have call successors, (253) [2024-11-08 17:46:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3231 transitions. [2024-11-08 17:46:43,767 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3231 transitions. Word has length 165 [2024-11-08 17:46:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:43,767 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 3231 transitions. [2024-11-08 17:46:43,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:46:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3231 transitions. [2024-11-08 17:46:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 17:46:43,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:43,772 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:46:43,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-08 17:46:43,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:46:43,973 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:43,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash -674548405, now seen corresponding path program 1 times [2024-11-08 17:46:43,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:43,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569156638] [2024-11-08 17:46:43,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:43,975 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-08 17:46:43,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:43,976 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:46:43,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-08 17:46:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:44,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:46:44,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:46:44,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:46:44,831 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:46:44,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569156638] [2024-11-08 17:46:44,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569156638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:46:44,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:46:44,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:46:44,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687698594] [2024-11-08 17:46:44,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:46:44,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:46:44,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:46:44,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:46:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:46:44,834 INFO L87 Difference]: Start difference. First operand 2531 states and 3231 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:46:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:46:45,475 INFO L93 Difference]: Finished difference Result 4845 states and 6214 transitions. [2024-11-08 17:46:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:46:45,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 165 [2024-11-08 17:46:45,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:46:45,487 INFO L225 Difference]: With dead ends: 4845 [2024-11-08 17:46:45,487 INFO L226 Difference]: Without dead ends: 2555 [2024-11-08 17:46:45,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 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-08 17:46:45,492 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:46:45,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 742 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:46:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2024-11-08 17:46:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2555. [2024-11-08 17:46:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2177 states have (on average 1.262746899402848) internal successors, (2749), 2199 states have internal predecessors, (2749), 253 states have call successors, (253), 124 states have call predecessors, (253), 124 states have return successors, (253), 231 states have call predecessors, (253), 253 states have call successors, (253) [2024-11-08 17:46:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3255 transitions. [2024-11-08 17:46:46,031 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3255 transitions. Word has length 165 [2024-11-08 17:46:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:46:46,031 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 3255 transitions. [2024-11-08 17:46:46,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:46:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3255 transitions. [2024-11-08 17:46:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 17:46:46,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:46:46,035 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:46:46,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-08 17:46:46,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:46:46,236 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:46:46,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:46:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1037920535, now seen corresponding path program 1 times [2024-11-08 17:46:46,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:46:46,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319840519] [2024-11-08 17:46:46,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:46:46,237 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-08 17:46:46,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:46:46,238 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:46:46,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-08 17:46:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:46:47,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-08 17:46:47,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:46:47,496 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-08 17:46:48,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-08 17:46:50,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:50,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 77 [2024-11-08 17:46:51,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 80 [2024-11-08 17:46:54,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:54,415 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 210 treesize of output 113 [2024-11-08 17:46:56,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:56,098 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 205 treesize of output 123 [2024-11-08 17:46:58,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:46:58,330 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 215 treesize of output 136 [2024-11-08 17:47:00,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:00,858 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 230 treesize of output 139 [2024-11-08 17:47:02,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:02,951 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 230 treesize of output 139 [2024-11-08 17:47:04,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:04,966 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 230 treesize of output 139 [2024-11-08 17:47:07,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:07,162 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 267 treesize of output 161 [2024-11-08 17:47:11,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:11,234 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 254 treesize of output 169 [2024-11-08 17:47:14,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:14,531 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 316 treesize of output 124 [2024-11-08 17:47:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-08 17:47:15,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:47:15,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:47:15,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319840519] [2024-11-08 17:47:15,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319840519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:47:15,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:47:15,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 17:47:15,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745668796] [2024-11-08 17:47:15,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:47:15,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:47:15,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:47:15,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:47:15,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:47:15,576 INFO L87 Difference]: Start difference. First operand 2555 states and 3255 transitions. Second operand has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 21 states have internal predecessors, (98), 7 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2024-11-08 17:47:17,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:47:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:47:54,898 INFO L93 Difference]: Finished difference Result 4913 states and 6273 transitions. [2024-11-08 17:47:54,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 17:47:54,900 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 21 states have internal predecessors, (98), 7 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 167 [2024-11-08 17:47:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:47:54,914 INFO L225 Difference]: With dead ends: 4913 [2024-11-08 17:47:54,914 INFO L226 Difference]: Without dead ends: 2599 [2024-11-08 17:47:54,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:47:54,919 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 980 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:47:54,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 954 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 37.2s Time] [2024-11-08 17:47:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2024-11-08 17:47:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2433. [2024-11-08 17:47:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2057 states have (on average 1.2615459406903258) internal successors, (2595), 2077 states have internal predecessors, (2595), 251 states have call successors, (251), 124 states have call predecessors, (251), 124 states have return successors, (251), 231 states have call predecessors, (251), 251 states have call successors, (251) [2024-11-08 17:47:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3097 transitions. [2024-11-08 17:47:55,543 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3097 transitions. Word has length 167 [2024-11-08 17:47:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:47:55,543 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 3097 transitions. [2024-11-08 17:47:55,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 21 states have internal predecessors, (98), 7 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2024-11-08 17:47:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3097 transitions. [2024-11-08 17:47:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 17:47:55,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:47:55,547 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:47:55,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-11-08 17:47:55,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:47:55,747 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:47:55,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:47:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash 981081243, now seen corresponding path program 1 times [2024-11-08 17:47:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:47:55,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739113614] [2024-11-08 17:47:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:47:55,748 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-08 17:47:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:47:55,750 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:47:55,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-08 17:47:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:47:56,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-08 17:47:56,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:47:56,781 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-08 17:47:57,610 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 34 [2024-11-08 17:47:57,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-08 17:47:59,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:47:59,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 77 [2024-11-08 17:48:00,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 80 [2024-11-08 17:48:03,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:48:03,562 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 210 treesize of output 113 [2024-11-08 17:48:05,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:48:05,039 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 210 treesize of output 113 [2024-11-08 17:48:06,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:48:06,602 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 210 treesize of output 113 [2024-11-08 17:48:08,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:48:08,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 123 [2024-11-08 17:48:10,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:48:10,206 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 220 treesize of output 126 [2024-11-08 17:48:11,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:48:11,883 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 220 treesize of output 126 [2024-11-08 17:48:13,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:48:13,716 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 257 treesize of output 157 [2024-11-08 17:48:17,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:48:17,509 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 249 treesize of output 164 [2024-11-08 17:48:20,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:48:20,407 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 338 treesize of output 128 [2024-11-08 17:48:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-08 17:48:21,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:48:21,417 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:48:21,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739113614] [2024-11-08 17:48:21,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739113614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:48:21,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:48:21,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 17:48:21,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279504908] [2024-11-08 17:48:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:48:21,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 17:48:21,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:48:21,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 17:48:21,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:48:21,420 INFO L87 Difference]: Start difference. First operand 2433 states and 3097 transitions. Second operand has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 20 states have internal predecessors, (92), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-08 17:49:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:04,649 INFO L93 Difference]: Finished difference Result 6915 states and 8891 transitions. [2024-11-08 17:49:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 17:49:04,650 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 20 states have internal predecessors, (92), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 167 [2024-11-08 17:49:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:04,663 INFO L225 Difference]: With dead ends: 6915 [2024-11-08 17:49:04,663 INFO L226 Difference]: Without dead ends: 4723 [2024-11-08 17:49:04,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2024-11-08 17:49:04,668 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 554 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 2666 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:04,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 984 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2666 Invalid, 0 Unknown, 0 Unchecked, 41.0s Time] [2024-11-08 17:49:04,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states. [2024-11-08 17:49:05,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 2543. [2024-11-08 17:49:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2167 states have (on average 1.2704199353945547) internal successors, (2753), 2187 states have internal predecessors, (2753), 251 states have call successors, (251), 124 states have call predecessors, (251), 124 states have return successors, (251), 231 states have call predecessors, (251), 251 states have call successors, (251) [2024-11-08 17:49:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3255 transitions. [2024-11-08 17:49:05,500 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3255 transitions. Word has length 167 [2024-11-08 17:49:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:05,501 INFO L471 AbstractCegarLoop]: Abstraction has 2543 states and 3255 transitions. [2024-11-08 17:49:05,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.380952380952381) internal successors, (92), 20 states have internal predecessors, (92), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-08 17:49:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3255 transitions. [2024-11-08 17:49:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 17:49:05,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:05,505 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:49:05,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-08 17:49:05,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:49:05,706 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:05,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:05,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1326762877, now seen corresponding path program 1 times [2024-11-08 17:49:05,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:49:05,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678130521] [2024-11-08 17:49:05,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:05,708 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-08 17:49:05,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:49:05,711 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 17:49:05,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afd0855e-fff1-4094-8388-c3f22587893d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process