./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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_51b997e8-8931-402c-be86-6506afcc02fb/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 d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:35:46,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:35:46,199 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:35:46,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:35:46,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:35:46,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:35:46,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:35:46,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:35:46,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:35:46,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:35:46,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:35:46,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:35:46,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:35:46,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:35:46,252 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:35:46,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:35:46,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:35:46,256 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:35:46,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:35:46,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:35:46,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:35:46,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:35:46,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:35:46,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:35:46,261 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:35:46,262 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:35:46,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:35:46,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:35:46,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:35:46,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:35:46,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:35:46,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:35:46,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:35:46,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:35:46,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:35:46,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:35:46,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:35:46,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:35:46,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:35:46,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:35:46,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:35:46,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:35:46,269 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_51b997e8-8931-402c-be86-6506afcc02fb/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_51b997e8-8931-402c-be86-6506afcc02fb/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 -> d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 [2024-11-08 17:35:46,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:35:46,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:35:46,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:35:46,673 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:35:46,673 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:35:46,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i Unable to find full path for "g++" [2024-11-08 17:35:48,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:35:48,895 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:35:48,896 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-08 17:35:48,906 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/data/a7c790715/d878b2e043d74577a09417f2182e3c75/FLAG88d982515 [2024-11-08 17:35:49,260 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/data/a7c790715/d878b2e043d74577a09417f2182e3c75 [2024-11-08 17:35:49,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:35:49,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:35:49,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:35:49,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:35:49,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:35:49,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:35:49" (1/1) ... [2024-11-08 17:35:49,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2415ef65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:49, skipping insertion in model container [2024-11-08 17:35:49,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:35:49" (1/1) ... [2024-11-08 17:35:49,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:35:49,566 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_51b997e8-8931-402c-be86-6506afcc02fb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2024-11-08 17:35:49,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:35:49,650 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:35:49,663 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_51b997e8-8931-402c-be86-6506afcc02fb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2024-11-08 17:35:49,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:35:49,726 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:35:49,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:49 WrapperNode [2024-11-08 17:35:49,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:35:49,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:35:49,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:35:49,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:35:49,744 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:49" (1/1) ... [2024-11-08 17:35:49,762 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:49" (1/1) ... [2024-11-08 17:35:49,815 INFO L138 Inliner]: procedures = 30, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 529 [2024-11-08 17:35:49,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:35:49,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:35:49,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:35:49,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:35:49,831 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:49" (1/1) ... [2024-11-08 17:35:49,832 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:49" (1/1) ... [2024-11-08 17:35:49,840 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:49" (1/1) ... [2024-11-08 17:35:49,852 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 17:35:49,856 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:49" (1/1) ... [2024-11-08 17:35:49,857 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:49" (1/1) ... [2024-11-08 17:35:49,888 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:49" (1/1) ... [2024-11-08 17:35:49,897 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:49" (1/1) ... [2024-11-08 17:35:49,904 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:49" (1/1) ... [2024-11-08 17:35:49,908 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:49" (1/1) ... [2024-11-08 17:35:49,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:35:49,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:35:49,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:35:49,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:35:49,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:49" (1/1) ... [2024-11-08 17:35:49,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:35:49,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:35:49,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:49,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:35:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 17:35:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 17:35:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 17:35:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 17:35:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 17:35:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 17:35:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:35:50,008 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:35:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 17:35:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:35:50,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:35:50,180 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:35:50,182 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:35:50,883 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-08 17:35:50,883 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:35:50,901 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:35:50,901 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:35:50,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:35:50 BoogieIcfgContainer [2024-11-08 17:35:50,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:35:50,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:35:50,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:35:50,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:35:50,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:35:49" (1/3) ... [2024-11-08 17:35:50,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737dc768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:35:50, skipping insertion in model container [2024-11-08 17:35:50,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:35:49" (2/3) ... [2024-11-08 17:35:50,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737dc768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:35:50, skipping insertion in model container [2024-11-08 17:35:50,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:35:50" (3/3) ... [2024-11-08 17:35:50,916 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-08 17:35:50,936 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:35:50,936 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:35:51,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:35:51,015 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;@6e76f0ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:35:51,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:35:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:35:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 17:35:51,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:51,033 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:51,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:51,040 INFO L85 PathProgramCache]: Analyzing trace with hash 796296726, now seen corresponding path program 1 times [2024-11-08 17:35:51,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:51,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251981443] [2024-11-08 17:35:51,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:35:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:35:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:35:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:35:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:35:51,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:51,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251981443] [2024-11-08 17:35:51,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251981443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:51,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:51,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:35:51,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274505832] [2024-11-08 17:35:51,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:51,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:35:51,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:51,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:35:51,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:35:51,622 INFO L87 Difference]: Start difference. First operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:35:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:51,656 INFO L93 Difference]: Finished difference Result 215 states and 330 transitions. [2024-11-08 17:35:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:35:51,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-11-08 17:35:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:51,666 INFO L225 Difference]: With dead ends: 215 [2024-11-08 17:35:51,667 INFO L226 Difference]: Without dead ends: 107 [2024-11-08 17:35:51,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:51,674 INFO L432 NwaCegarLoop]: 155 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, 155 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:51,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 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:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-08 17:35:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-08 17:35:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:35:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-11-08 17:35:51,741 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 116 [2024-11-08 17:35:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:51,742 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-11-08 17:35:51,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:35:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-11-08 17:35:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 17:35:51,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:51,750 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:35:51,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:51,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1178865498, now seen corresponding path program 1 times [2024-11-08 17:35:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279621151] [2024-11-08 17:35:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:35:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:35:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:35:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:35:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:35:52,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279621151] [2024-11-08 17:35:52,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279621151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:52,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:52,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:52,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253692568] [2024-11-08 17:35:52,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:52,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:52,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:52,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:52,258 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:35:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:52,331 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2024-11-08 17:35:52,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:52,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-11-08 17:35:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:52,334 INFO L225 Difference]: With dead ends: 213 [2024-11-08 17:35:52,334 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 17:35:52,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:52,338 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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:52,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 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:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 17:35:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-08 17:35:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:35:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-08 17:35:52,358 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 116 [2024-11-08 17:35:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:52,364 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-08 17:35:52,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:35:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-08 17:35:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 17:35:52,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:52,366 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:35:52,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:52,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2017899160, now seen corresponding path program 1 times [2024-11-08 17:35:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:52,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179098458] [2024-11-08 17:35:52,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:35:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:35:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:35:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:35:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:35:52,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:52,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179098458] [2024-11-08 17:35:52,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179098458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:52,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:52,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:52,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236629191] [2024-11-08 17:35:52,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:52,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:52,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:52,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:52,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:52,851 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:52,934 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-08 17:35:52,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-08 17:35:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:52,937 INFO L225 Difference]: With dead ends: 217 [2024-11-08 17:35:52,940 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 17:35:52,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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:52,942 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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:52,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 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:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 17:35:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-08 17:35:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:35:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-08 17:35:52,959 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 116 [2024-11-08 17:35:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:52,961 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-08 17:35:52,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-08 17:35:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 17:35:52,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:52,966 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:35:52,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:52,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash 497556163, now seen corresponding path program 1 times [2024-11-08 17:35:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:52,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678072651] [2024-11-08 17:35:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:52,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:35:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:35:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:35:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:35:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:35:53,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678072651] [2024-11-08 17:35:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678072651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:53,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168104246] [2024-11-08 17:35:53,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:53,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:53,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:53,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:53,241 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:53,286 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-08 17:35:53,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:53,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-08 17:35:53,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:53,291 INFO L225 Difference]: With dead ends: 222 [2024-11-08 17:35:53,291 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 17:35:53,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:53,297 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 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:53,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 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:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 17:35:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-08 17:35:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:35:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-08 17:35:53,313 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 118 [2024-11-08 17:35:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:53,314 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-08 17:35:53,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-08 17:35:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 17:35:53,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:53,320 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:35:53,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:53,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2022403771, now seen corresponding path program 1 times [2024-11-08 17:35:53,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:53,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116310567] [2024-11-08 17:35:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:53,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:35:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:35:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:35:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:35:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:35:53,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:53,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116310567] [2024-11-08 17:35:53,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116310567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:53,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:53,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:53,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671383033] [2024-11-08 17:35:53,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:53,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:53,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:53,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:53,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:53,550 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:53,578 INFO L93 Difference]: Finished difference Result 226 states and 323 transitions. [2024-11-08 17:35:53,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:53,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-08 17:35:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:53,580 INFO L225 Difference]: With dead ends: 226 [2024-11-08 17:35:53,580 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 17:35:53,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:53,581 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 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:53,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 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:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 17:35:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-08 17:35:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:35:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-08 17:35:53,589 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 118 [2024-11-08 17:35:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:53,589 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-08 17:35:53,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-08 17:35:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 17:35:53,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:53,591 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:35:53,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:53,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:53,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2020556729, now seen corresponding path program 1 times [2024-11-08 17:35:53,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:53,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377682144] [2024-11-08 17:35:53,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:35:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:35:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:35:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:35:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:35:54,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377682144] [2024-11-08 17:35:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377682144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:35:54,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714987440] [2024-11-08 17:35:54,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:54,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:35:54,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:54,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:35:54,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:35:54,123 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:54,416 INFO L93 Difference]: Finished difference Result 243 states and 347 transitions. [2024-11-08 17:35:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:35:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-08 17:35:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:54,420 INFO L225 Difference]: With dead ends: 243 [2024-11-08 17:35:54,420 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 17:35:54,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:35:54,424 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:54,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 486 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:35:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 17:35:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2024-11-08 17:35:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:35:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-11-08 17:35:54,444 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 118 [2024-11-08 17:35:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:54,444 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-11-08 17:35:54,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-11-08 17:35:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 17:35:54,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:54,448 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:35:54,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:54,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1958517115, now seen corresponding path program 1 times [2024-11-08 17:35:54,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385450788] [2024-11-08 17:35:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:54,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:35:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:35:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:35:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:35:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:35:54,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:54,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385450788] [2024-11-08 17:35:54,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385450788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:54,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:54,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:35:54,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659323354] [2024-11-08 17:35:54,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:54,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:35:54,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:54,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:35:54,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:35:54,838 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:54,872 INFO L93 Difference]: Finished difference Result 233 states and 329 transitions. [2024-11-08 17:35:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:35:54,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-08 17:35:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:54,875 INFO L225 Difference]: With dead ends: 233 [2024-11-08 17:35:54,876 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 17:35:54,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:54,878 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 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:54,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 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:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 17:35:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-08 17:35:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 104 states have internal predecessors, (141), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:35:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 165 transitions. [2024-11-08 17:35:54,890 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 165 transitions. Word has length 118 [2024-11-08 17:35:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:54,893 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 165 transitions. [2024-11-08 17:35:54,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 165 transitions. [2024-11-08 17:35:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 17:35:54,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:54,895 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:35:54,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:54,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:54,896 INFO L85 PathProgramCache]: Analyzing trace with hash -282446754, now seen corresponding path program 1 times [2024-11-08 17:35:54,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:54,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7414074] [2024-11-08 17:35:54,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:35:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:35:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:35:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:35:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:35:55,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:55,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7414074] [2024-11-08 17:35:55,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7414074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:55,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:55,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:35:55,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662850193] [2024-11-08 17:35:55,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:55,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:35:55,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:55,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:35:55,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:35:55,303 INFO L87 Difference]: Start difference. First operand 118 states and 165 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:55,317 INFO L93 Difference]: Finished difference Result 233 states and 327 transitions. [2024-11-08 17:35:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:35:55,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-08 17:35:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:55,319 INFO L225 Difference]: With dead ends: 233 [2024-11-08 17:35:55,319 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 17:35:55,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:35:55,320 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:55,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:35:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 17:35:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-08 17:35:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:35:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2024-11-08 17:35:55,330 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 120 [2024-11-08 17:35:55,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:55,331 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2024-11-08 17:35:55,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:35:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2024-11-08 17:35:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 17:35:55,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:55,334 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:35:55,335 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1971390496, now seen corresponding path program 1 times [2024-11-08 17:35:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:55,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287184737] [2024-11-08 17:35:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:35:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:35:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:35:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:35:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:35:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:35:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:35:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:35:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:35:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:35:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:35:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:35:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:35:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:35:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:35:58,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287184737] [2024-11-08 17:35:58,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287184737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:35:58,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:35:58,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:35:58,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957928279] [2024-11-08 17:35:58,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:35:58,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:35:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:35:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:35:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:35:58,847 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 17:35:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:35:59,723 INFO L93 Difference]: Finished difference Result 285 states and 394 transitions. [2024-11-08 17:35:59,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:35:59,727 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 120 [2024-11-08 17:35:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:35:59,728 INFO L225 Difference]: With dead ends: 285 [2024-11-08 17:35:59,728 INFO L226 Difference]: Without dead ends: 170 [2024-11-08 17:35:59,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:35:59,730 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 346 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:35:59,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 386 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:35:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-08 17:35:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 133. [2024-11-08 17:35:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.3361344537815125) internal successors, (159), 119 states have internal predecessors, (159), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:35:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 183 transitions. [2024-11-08 17:35:59,751 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 183 transitions. Word has length 120 [2024-11-08 17:35:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:35:59,752 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 183 transitions. [2024-11-08 17:35:59,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 17:35:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 183 transitions. [2024-11-08 17:35:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:35:59,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:35:59,754 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:35:59,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:35:59,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:35:59,755 INFO L85 PathProgramCache]: Analyzing trace with hash 22382147, now seen corresponding path program 1 times [2024-11-08 17:35:59,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:35:59,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128075292] [2024-11-08 17:35:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:35:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:35:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:36:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:36:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:36:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:36:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:36:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:36:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:36:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:36:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:36:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:36:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:36:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:36:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:36:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:36:00,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128075292] [2024-11-08 17:36:00,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128075292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:00,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:00,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:36:00,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020344120] [2024-11-08 17:36:00,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:00,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:36:00,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:36:00,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:36:00,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:36:00,155 INFO L87 Difference]: Start difference. First operand 133 states and 183 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:36:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:00,463 INFO L93 Difference]: Finished difference Result 299 states and 412 transitions. [2024-11-08 17:36:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:36:00,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-08 17:36:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:00,465 INFO L225 Difference]: With dead ends: 299 [2024-11-08 17:36:00,466 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 17:36:00,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:36:00,467 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 44 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:36:00,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 475 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:36:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 17:36:00,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2024-11-08 17:36:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 121 states have internal predecessors, (161), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:36:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 185 transitions. [2024-11-08 17:36:00,487 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 185 transitions. Word has length 121 [2024-11-08 17:36:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:00,487 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 185 transitions. [2024-11-08 17:36:00,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:36:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 185 transitions. [2024-11-08 17:36:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:36:00,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:00,491 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:36:00,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:00,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2026368515, now seen corresponding path program 1 times [2024-11-08 17:36:00,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:36:00,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301651470] [2024-11-08 17:36:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:00,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:36:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:36:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:36:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:36:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:36:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:36:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:36:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:36:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:36:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:36:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:36:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:36:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:36:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:36:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:36:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301651470] [2024-11-08 17:36:00,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301651470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:00,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:00,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:36:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028957477] [2024-11-08 17:36:00,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:00,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:36:00,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:36:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:36:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:36:00,837 INFO L87 Difference]: Start difference. First operand 135 states and 185 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:36:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:00,887 INFO L93 Difference]: Finished difference Result 270 states and 371 transitions. [2024-11-08 17:36:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:36:00,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-08 17:36:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:00,889 INFO L225 Difference]: With dead ends: 270 [2024-11-08 17:36:00,889 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 17:36:00,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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:36:00,890 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:36:00,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:36:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 17:36:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-08 17:36:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.3225806451612903) internal successors, (164), 124 states have internal predecessors, (164), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:36:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2024-11-08 17:36:00,907 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 121 [2024-11-08 17:36:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:00,907 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 188 transitions. [2024-11-08 17:36:00,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:36:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 188 transitions. [2024-11-08 17:36:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:36:00,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:00,909 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:36:00,909 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:00,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:00,910 INFO L85 PathProgramCache]: Analyzing trace with hash -721472183, now seen corresponding path program 1 times [2024-11-08 17:36:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:36:00,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598334009] [2024-11-08 17:36:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:36:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:36:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:36:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:36:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:36:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:36:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:36:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:36:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:36:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:36:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:36:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:36:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:36:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:36:02,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:36:02,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598334009] [2024-11-08 17:36:02,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598334009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:02,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:02,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:36:02,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186971344] [2024-11-08 17:36:02,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:02,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:36:02,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:36:02,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:36:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:36:02,100 INFO L87 Difference]: Start difference. First operand 138 states and 188 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:36:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:36:02,692 INFO L93 Difference]: Finished difference Result 338 states and 459 transitions. [2024-11-08 17:36:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:36:02,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-08 17:36:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:36:02,694 INFO L225 Difference]: With dead ends: 338 [2024-11-08 17:36:02,694 INFO L226 Difference]: Without dead ends: 203 [2024-11-08 17:36:02,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:36:02,695 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 267 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:36:02,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 634 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:36:02,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-08 17:36:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 158. [2024-11-08 17:36:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 144 states have internal predecessors, (191), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:36:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 215 transitions. [2024-11-08 17:36:02,715 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 215 transitions. Word has length 122 [2024-11-08 17:36:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:36:02,715 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 215 transitions. [2024-11-08 17:36:02,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:36:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 215 transitions. [2024-11-08 17:36:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:36:02,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:36:02,718 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:36:02,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:36:02,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:36:02,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1742540537, now seen corresponding path program 1 times [2024-11-08 17:36:02,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:36:02,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60758805] [2024-11-08 17:36:02,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:36:02,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:36:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:36:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:36:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:36:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:36:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:36:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:36:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:36:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:36:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:36:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:36:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:36:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:36:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:36:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:36:27,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:36:27,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60758805] [2024-11-08 17:36:27,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60758805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:36:27,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:36:27,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 17:36:27,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293388000] [2024-11-08 17:36:27,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:36:27,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 17:36:27,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:36:27,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 17:36:27,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=353, Unknown=2, NotChecked=0, Total=420 [2024-11-08 17:36:27,815 INFO L87 Difference]: Start difference. First operand 158 states and 215 transitions. Second operand has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 17:36:46,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:36:50,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:36:51,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:36:53,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:36:54,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:36:56,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:37:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:13,582 INFO L93 Difference]: Finished difference Result 374 states and 506 transitions. [2024-11-08 17:37:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:37:13,583 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2024-11-08 17:37:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:13,584 INFO L225 Difference]: With dead ends: 374 [2024-11-08 17:37:13,585 INFO L226 Difference]: Without dead ends: 219 [2024-11-08 17:37:13,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=199, Invalid=855, Unknown=2, NotChecked=0, Total=1056 [2024-11-08 17:37:13,586 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 598 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:13,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1199 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 19.2s Time] [2024-11-08 17:37:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-08 17:37:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 176. [2024-11-08 17:37:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 162 states have internal predecessors, (214), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:37:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2024-11-08 17:37:13,605 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 122 [2024-11-08 17:37:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:13,606 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2024-11-08 17:37:13,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 17:37:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2024-11-08 17:37:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:37:13,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:13,608 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:13,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:37:13,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:13,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:13,609 INFO L85 PathProgramCache]: Analyzing trace with hash 629198725, now seen corresponding path program 1 times [2024-11-08 17:37:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:13,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640132113] [2024-11-08 17:37:13,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:14,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:14,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640132113] [2024-11-08 17:37:14,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640132113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:14,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:14,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:37:14,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069664494] [2024-11-08 17:37:14,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:14,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:37:14,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:14,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:37:14,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:37:14,526 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:15,189 INFO L93 Difference]: Finished difference Result 334 states and 453 transitions. [2024-11-08 17:37:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:37:15,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-08 17:37:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:15,191 INFO L225 Difference]: With dead ends: 334 [2024-11-08 17:37:15,191 INFO L226 Difference]: Without dead ends: 161 [2024-11-08 17:37:15,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:37:15,193 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 127 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:15,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 541 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:37:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-08 17:37:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2024-11-08 17:37:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 146 states have internal predecessors, (192), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:37:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 216 transitions. [2024-11-08 17:37:15,210 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 216 transitions. Word has length 122 [2024-11-08 17:37:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:15,210 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 216 transitions. [2024-11-08 17:37:15,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 216 transitions. [2024-11-08 17:37:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:37:15,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:15,212 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:15,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:37:15,212 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:15,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1423072057, now seen corresponding path program 1 times [2024-11-08 17:37:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:15,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302589903] [2024-11-08 17:37:15,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:15,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:18,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:18,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302589903] [2024-11-08 17:37:18,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302589903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:18,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:18,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:37:18,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096265549] [2024-11-08 17:37:18,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:18,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:37:18,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:18,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:37:18,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:37:18,496 INFO L87 Difference]: Start difference. First operand 160 states and 216 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:37:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:21,446 INFO L93 Difference]: Finished difference Result 436 states and 585 transitions. [2024-11-08 17:37:21,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 17:37:21,447 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-08 17:37:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:21,449 INFO L225 Difference]: With dead ends: 436 [2024-11-08 17:37:21,449 INFO L226 Difference]: Without dead ends: 279 [2024-11-08 17:37:21,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 17:37:21,451 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 385 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:21,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 970 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 17:37:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-08 17:37:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 174. [2024-11-08 17:37:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.325) internal successors, (212), 160 states have internal predecessors, (212), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:37:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 236 transitions. [2024-11-08 17:37:21,470 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 236 transitions. Word has length 122 [2024-11-08 17:37:21,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:21,470 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 236 transitions. [2024-11-08 17:37:21,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:37:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 236 transitions. [2024-11-08 17:37:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:37:21,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:21,472 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:21,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:37:21,473 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:21,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1850826885, now seen corresponding path program 1 times [2024-11-08 17:37:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699135484] [2024-11-08 17:37:21,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:21,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:22,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:22,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699135484] [2024-11-08 17:37:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699135484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:22,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:22,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:37:22,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771596836] [2024-11-08 17:37:22,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:22,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:37:22,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:22,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:37:22,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:37:22,472 INFO L87 Difference]: Start difference. First operand 174 states and 236 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:23,105 INFO L93 Difference]: Finished difference Result 403 states and 544 transitions. [2024-11-08 17:37:23,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:37:23,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-08 17:37:23,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:23,107 INFO L225 Difference]: With dead ends: 403 [2024-11-08 17:37:23,108 INFO L226 Difference]: Without dead ends: 232 [2024-11-08 17:37:23,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:37:23,109 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 350 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:23,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 536 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:37:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-08 17:37:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 184. [2024-11-08 17:37:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 170 states have internal predecessors, (224), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:37:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 248 transitions. [2024-11-08 17:37:23,131 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 248 transitions. Word has length 122 [2024-11-08 17:37:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:23,132 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 248 transitions. [2024-11-08 17:37:23,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 248 transitions. [2024-11-08 17:37:23,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:37:23,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:23,133 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:23,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:37:23,133 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:23,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:23,134 INFO L85 PathProgramCache]: Analyzing trace with hash 948667205, now seen corresponding path program 1 times [2024-11-08 17:37:23,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:23,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232705084] [2024-11-08 17:37:23,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:23,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:26,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232705084] [2024-11-08 17:37:26,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232705084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:26,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:26,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:37:26,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143686465] [2024-11-08 17:37:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:26,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:37:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:37:26,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:37:26,844 INFO L87 Difference]: Start difference. First operand 184 states and 248 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:37:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:30,260 INFO L93 Difference]: Finished difference Result 494 states and 660 transitions. [2024-11-08 17:37:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:37:30,261 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-08 17:37:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:30,263 INFO L225 Difference]: With dead ends: 494 [2024-11-08 17:37:30,263 INFO L226 Difference]: Without dead ends: 313 [2024-11-08 17:37:30,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 17:37:30,265 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 535 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:30,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 926 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:37:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-08 17:37:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 199. [2024-11-08 17:37:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 185 states have (on average 1.3243243243243243) internal successors, (245), 185 states have internal predecessors, (245), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:37:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 269 transitions. [2024-11-08 17:37:30,286 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 269 transitions. Word has length 122 [2024-11-08 17:37:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:30,287 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 269 transitions. [2024-11-08 17:37:30,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:37:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 269 transitions. [2024-11-08 17:37:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:37:30,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:30,289 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:30,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:37:30,289 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:30,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash -72401149, now seen corresponding path program 1 times [2024-11-08 17:37:30,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:30,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43715327] [2024-11-08 17:37:30,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:30,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:33,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:33,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43715327] [2024-11-08 17:37:33,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43715327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:33,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:33,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 17:37:33,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979914790] [2024-11-08 17:37:33,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:33,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:37:33,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:33,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:37:33,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:37:33,324 INFO L87 Difference]: Start difference. First operand 199 states and 269 transitions. Second operand has 15 states, 13 states have (on average 5.0) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-08 17:37:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:34,711 INFO L93 Difference]: Finished difference Result 448 states and 601 transitions. [2024-11-08 17:37:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:37:34,711 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.0) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 122 [2024-11-08 17:37:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:34,713 INFO L225 Difference]: With dead ends: 448 [2024-11-08 17:37:34,713 INFO L226 Difference]: Without dead ends: 252 [2024-11-08 17:37:34,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:37:34,714 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 274 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:34,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 730 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:37:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-08 17:37:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 227. [2024-11-08 17:37:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 210 states have (on average 1.3047619047619048) internal successors, (274), 211 states have internal predecessors, (274), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:37:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 302 transitions. [2024-11-08 17:37:34,745 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 302 transitions. Word has length 122 [2024-11-08 17:37:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:34,746 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 302 transitions. [2024-11-08 17:37:34,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.0) internal successors, (65), 15 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-08 17:37:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 302 transitions. [2024-11-08 17:37:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:37:34,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:34,747 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:34,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:37:34,748 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:34,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash -308608174, now seen corresponding path program 1 times [2024-11-08 17:37:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:34,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020339244] [2024-11-08 17:37:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:34,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:35,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020339244] [2024-11-08 17:37:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020339244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:37:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482150843] [2024-11-08 17:37:35,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:35,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:37:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:37:35,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:37:35,287 INFO L87 Difference]: Start difference. First operand 227 states and 302 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:35,507 INFO L93 Difference]: Finished difference Result 455 states and 607 transitions. [2024-11-08 17:37:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:37:35,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-11-08 17:37:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:35,510 INFO L225 Difference]: With dead ends: 455 [2024-11-08 17:37:35,511 INFO L226 Difference]: Without dead ends: 231 [2024-11-08 17:37:35,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:37:35,512 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:35,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:37:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-08 17:37:35,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 226. [2024-11-08 17:37:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 209 states have (on average 1.291866028708134) internal successors, (270), 210 states have internal predecessors, (270), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:37:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 298 transitions. [2024-11-08 17:37:35,542 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 298 transitions. Word has length 123 [2024-11-08 17:37:35,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:35,542 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 298 transitions. [2024-11-08 17:37:35,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 298 transitions. [2024-11-08 17:37:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 17:37:35,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:35,544 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:35,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:37:35,544 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:35,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash 220662733, now seen corresponding path program 1 times [2024-11-08 17:37:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276000507] [2024-11-08 17:37:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:39,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:39,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276000507] [2024-11-08 17:37:39,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276000507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:39,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:39,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:37:39,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824522218] [2024-11-08 17:37:39,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:39,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:37:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:39,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:37:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:37:39,994 INFO L87 Difference]: Start difference. First operand 226 states and 298 transitions. Second operand has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 17:37:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:42,407 INFO L93 Difference]: Finished difference Result 524 states and 689 transitions. [2024-11-08 17:37:42,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:37:42,408 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 124 [2024-11-08 17:37:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:42,410 INFO L225 Difference]: With dead ends: 524 [2024-11-08 17:37:42,410 INFO L226 Difference]: Without dead ends: 301 [2024-11-08 17:37:42,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-11-08 17:37:42,411 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 331 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:42,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1068 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 17:37:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-08 17:37:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 231. [2024-11-08 17:37:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 214 states have (on average 1.2897196261682242) internal successors, (276), 215 states have internal predecessors, (276), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:37:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 304 transitions. [2024-11-08 17:37:42,437 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 304 transitions. Word has length 124 [2024-11-08 17:37:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:42,438 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 304 transitions. [2024-11-08 17:37:42,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 17:37:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 304 transitions. [2024-11-08 17:37:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 17:37:42,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:42,442 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:42,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 17:37:42,443 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:42,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:42,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1165540661, now seen corresponding path program 1 times [2024-11-08 17:37:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:42,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407537568] [2024-11-08 17:37:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:42,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:46,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407537568] [2024-11-08 17:37:46,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407537568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:46,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:46,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 17:37:46,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591227028] [2024-11-08 17:37:46,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:46,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:37:46,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:46,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:37:46,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:37:46,640 INFO L87 Difference]: Start difference. First operand 231 states and 304 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 17:37:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:48,759 INFO L93 Difference]: Finished difference Result 461 states and 606 transitions. [2024-11-08 17:37:48,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:37:48,759 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-11-08 17:37:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:48,761 INFO L225 Difference]: With dead ends: 461 [2024-11-08 17:37:48,761 INFO L226 Difference]: Without dead ends: 233 [2024-11-08 17:37:48,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2024-11-08 17:37:48,763 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 399 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:48,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 884 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:37:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-08 17:37:48,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 213. [2024-11-08 17:37:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 196 states have (on average 1.2908163265306123) internal successors, (253), 197 states have internal predecessors, (253), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:37:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 281 transitions. [2024-11-08 17:37:48,793 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 281 transitions. Word has length 124 [2024-11-08 17:37:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:48,794 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 281 transitions. [2024-11-08 17:37:48,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 17:37:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 281 transitions. [2024-11-08 17:37:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:37:48,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:48,797 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:48,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:37:48,798 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:48,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1148006873, now seen corresponding path program 1 times [2024-11-08 17:37:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:48,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53707369] [2024-11-08 17:37:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:48,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:49,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:49,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:49,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:49,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:49,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:49,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:49,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53707369] [2024-11-08 17:37:49,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53707369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:49,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:49,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:37:49,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063753642] [2024-11-08 17:37:49,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:49,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:37:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:37:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:37:49,017 INFO L87 Difference]: Start difference. First operand 213 states and 281 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:49,070 INFO L93 Difference]: Finished difference Result 423 states and 559 transitions. [2024-11-08 17:37:49,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:37:49,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-08 17:37:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:49,073 INFO L225 Difference]: With dead ends: 423 [2024-11-08 17:37:49,073 INFO L226 Difference]: Without dead ends: 213 [2024-11-08 17:37:49,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:37:49,074 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:49,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:37:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-08 17:37:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-08 17:37:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 196 states have (on average 1.280612244897959) internal successors, (251), 197 states have internal predecessors, (251), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:37:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 279 transitions. [2024-11-08 17:37:49,099 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 279 transitions. Word has length 125 [2024-11-08 17:37:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:49,099 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 279 transitions. [2024-11-08 17:37:49,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 279 transitions. [2024-11-08 17:37:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:37:49,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:49,101 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:49,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:37:49,102 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:49,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:49,102 INFO L85 PathProgramCache]: Analyzing trace with hash -478195007, now seen corresponding path program 1 times [2024-11-08 17:37:49,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:49,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9708660] [2024-11-08 17:37:49,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:51,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9708660] [2024-11-08 17:37:51,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9708660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:51,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:51,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:37:51,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833306128] [2024-11-08 17:37:51,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:51,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:37:51,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:51,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:37:51,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:37:51,840 INFO L87 Difference]: Start difference. First operand 213 states and 279 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:54,969 INFO L93 Difference]: Finished difference Result 530 states and 688 transitions. [2024-11-08 17:37:54,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 17:37:54,970 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-08 17:37:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:54,972 INFO L225 Difference]: With dead ends: 530 [2024-11-08 17:37:54,973 INFO L226 Difference]: Without dead ends: 320 [2024-11-08 17:37:54,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 17:37:54,974 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 398 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:54,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1530 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 17:37:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-08 17:37:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 235. [2024-11-08 17:37:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 218 states have (on average 1.2798165137614679) internal successors, (279), 219 states have internal predecessors, (279), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:37:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 307 transitions. [2024-11-08 17:37:55,008 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 307 transitions. Word has length 125 [2024-11-08 17:37:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:55,008 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 307 transitions. [2024-11-08 17:37:55,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 307 transitions. [2024-11-08 17:37:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:37:55,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:55,010 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 17:37:55,010 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:55,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:55,011 INFO L85 PathProgramCache]: Analyzing trace with hash 223404867, now seen corresponding path program 1 times [2024-11-08 17:37:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902285565] [2024-11-08 17:37:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:55,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902285565] [2024-11-08 17:37:55,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902285565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:55,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:55,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:37:55,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121949646] [2024-11-08 17:37:55,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:55,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:37:55,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:55,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:37:55,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:37:55,488 INFO L87 Difference]: Start difference. First operand 235 states and 307 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:37:55,907 INFO L93 Difference]: Finished difference Result 440 states and 576 transitions. [2024-11-08 17:37:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:37:55,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-08 17:37:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:37:55,909 INFO L225 Difference]: With dead ends: 440 [2024-11-08 17:37:55,909 INFO L226 Difference]: Without dead ends: 208 [2024-11-08 17:37:55,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:37:55,911 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 119 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:37:55,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 536 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:37:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-08 17:37:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-08 17:37:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 191 states have (on average 1.2670157068062826) internal successors, (242), 192 states have internal predecessors, (242), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:37:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 270 transitions. [2024-11-08 17:37:55,945 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 270 transitions. Word has length 125 [2024-11-08 17:37:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:37:55,946 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 270 transitions. [2024-11-08 17:37:55,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:37:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 270 transitions. [2024-11-08 17:37:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:37:55,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:37:55,947 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 17:37:55,948 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:37:55,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:37:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash -840235263, now seen corresponding path program 1 times [2024-11-08 17:37:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:37:55,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262741119] [2024-11-08 17:37:55,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:37:55,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:37:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:37:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:37:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:37:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:37:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:37:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:37:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:37:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:37:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:37:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:37:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:37:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:37:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:37:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:37:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:37:58,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262741119] [2024-11-08 17:37:58,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262741119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:37:58,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:37:58,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:37:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993404970] [2024-11-08 17:37:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:37:58,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:37:58,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:37:58,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:37:58,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:37:58,608 INFO L87 Difference]: Start difference. First operand 208 states and 270 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:01,219 INFO L93 Difference]: Finished difference Result 560 states and 720 transitions. [2024-11-08 17:38:01,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 17:38:01,220 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-08 17:38:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:01,222 INFO L225 Difference]: With dead ends: 560 [2024-11-08 17:38:01,222 INFO L226 Difference]: Without dead ends: 355 [2024-11-08 17:38:01,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2024-11-08 17:38:01,223 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 351 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:01,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1537 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 17:38:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-08 17:38:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 224. [2024-11-08 17:38:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 207 states have (on average 1.2705314009661837) internal successors, (263), 208 states have internal predecessors, (263), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:38:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 291 transitions. [2024-11-08 17:38:01,259 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 291 transitions. Word has length 125 [2024-11-08 17:38:01,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:01,259 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 291 transitions. [2024-11-08 17:38:01,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 291 transitions. [2024-11-08 17:38:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:38:01,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:01,261 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:01,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 17:38:01,261 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:01,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:01,262 INFO L85 PathProgramCache]: Analyzing trace with hash -862867517, now seen corresponding path program 1 times [2024-11-08 17:38:01,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:38:01,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977491852] [2024-11-08 17:38:01,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:01,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:38:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:38:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:38:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:38:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:38:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:38:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:38:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:38:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:38:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:38:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:38:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:38:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:38:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:38:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977491852] [2024-11-08 17:38:01,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977491852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:01,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:01,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:38:01,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34841897] [2024-11-08 17:38:01,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:01,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:38:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:38:01,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:38:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:38:01,730 INFO L87 Difference]: Start difference. First operand 224 states and 291 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:02,248 INFO L93 Difference]: Finished difference Result 503 states and 651 transitions. [2024-11-08 17:38:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:38:02,249 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-08 17:38:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:02,251 INFO L225 Difference]: With dead ends: 503 [2024-11-08 17:38:02,251 INFO L226 Difference]: Without dead ends: 282 [2024-11-08 17:38:02,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:38:02,252 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 162 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:02,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 827 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:38:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-08 17:38:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 242. [2024-11-08 17:38:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 225 states have (on average 1.271111111111111) internal successors, (286), 226 states have internal predecessors, (286), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 17:38:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 314 transitions. [2024-11-08 17:38:02,288 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 314 transitions. Word has length 125 [2024-11-08 17:38:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:02,288 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 314 transitions. [2024-11-08 17:38:02,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 314 transitions. [2024-11-08 17:38:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 17:38:02,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:02,290 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:02,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 17:38:02,290 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:02,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:02,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1097823602, now seen corresponding path program 1 times [2024-11-08 17:38:02,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:38:02,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442412164] [2024-11-08 17:38:02,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:02,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:38:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:38:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:38:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:38:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:38:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:38:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:38:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:38:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:38:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:38:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:38:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:38:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:38:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:07,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:38:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442412164] [2024-11-08 17:38:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442412164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:07,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 17:38:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982710248] [2024-11-08 17:38:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:07,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 17:38:07,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:38:07,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 17:38:07,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:38:07,803 INFO L87 Difference]: Start difference. First operand 242 states and 314 transitions. Second operand has 21 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 21 states have internal predecessors, (70), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-08 17:38:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:10,900 INFO L93 Difference]: Finished difference Result 644 states and 837 transitions. [2024-11-08 17:38:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:38:10,901 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 21 states have internal predecessors, (70), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 127 [2024-11-08 17:38:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:10,904 INFO L225 Difference]: With dead ends: 644 [2024-11-08 17:38:10,904 INFO L226 Difference]: Without dead ends: 405 [2024-11-08 17:38:10,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 17:38:10,905 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 522 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:10,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1131 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 17:38:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-08 17:38:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 371. [2024-11-08 17:38:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 341 states have (on average 1.2668621700879765) internal successors, (432), 342 states have internal predecessors, (432), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:38:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 484 transitions. [2024-11-08 17:38:10,965 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 484 transitions. Word has length 127 [2024-11-08 17:38:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:10,965 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 484 transitions. [2024-11-08 17:38:10,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 21 states have internal predecessors, (70), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-08 17:38:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 484 transitions. [2024-11-08 17:38:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 17:38:10,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:10,967 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:10,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 17:38:10,967 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:10,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1507512424, now seen corresponding path program 1 times [2024-11-08 17:38:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:38:10,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485889117] [2024-11-08 17:38:10,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:38:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:38:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:38:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:38:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:38:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:38:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:38:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:38:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:38:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:38:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:38:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:38:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:38:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:11,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:38:11,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485889117] [2024-11-08 17:38:11,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485889117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:11,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:11,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:38:11,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414238134] [2024-11-08 17:38:11,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:11,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:38:11,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:38:11,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:38:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:38:11,688 INFO L87 Difference]: Start difference. First operand 371 states and 484 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:12,393 INFO L93 Difference]: Finished difference Result 764 states and 989 transitions. [2024-11-08 17:38:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:38:12,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2024-11-08 17:38:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:12,396 INFO L225 Difference]: With dead ends: 764 [2024-11-08 17:38:12,396 INFO L226 Difference]: Without dead ends: 523 [2024-11-08 17:38:12,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:38:12,397 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 196 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:12,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 707 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:38:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-08 17:38:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 381. [2024-11-08 17:38:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 351 states have (on average 1.2678062678062678) internal successors, (445), 352 states have internal predecessors, (445), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:38:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 497 transitions. [2024-11-08 17:38:12,458 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 497 transitions. Word has length 127 [2024-11-08 17:38:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:12,459 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 497 transitions. [2024-11-08 17:38:12,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 497 transitions. [2024-11-08 17:38:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 17:38:12,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:12,461 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:12,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 17:38:12,461 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:12,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:12,462 INFO L85 PathProgramCache]: Analyzing trace with hash 740751931, now seen corresponding path program 1 times [2024-11-08 17:38:12,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:38:12,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642485265] [2024-11-08 17:38:12,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:38:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:38:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:38:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:38:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:38:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:38:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:38:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:38:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:38:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:38:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:38:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:38:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:38:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:17,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:38:17,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642485265] [2024-11-08 17:38:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642485265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-08 17:38:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012917737] [2024-11-08 17:38:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:17,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 17:38:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:38:17,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 17:38:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:38:17,796 INFO L87 Difference]: Start difference. First operand 381 states and 497 transitions. Second operand has 22 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 22 states have internal predecessors, (70), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-08 17:38:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:21,444 INFO L93 Difference]: Finished difference Result 679 states and 879 transitions. [2024-11-08 17:38:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:38:21,444 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 22 states have internal predecessors, (70), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) Word has length 127 [2024-11-08 17:38:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:21,447 INFO L225 Difference]: With dead ends: 679 [2024-11-08 17:38:21,447 INFO L226 Difference]: Without dead ends: 430 [2024-11-08 17:38:21,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2024-11-08 17:38:21,448 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 554 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:21,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1255 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 17:38:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-08 17:38:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 365. [2024-11-08 17:38:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 335 states have (on average 1.2656716417910447) internal successors, (424), 336 states have internal predecessors, (424), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:38:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 476 transitions. [2024-11-08 17:38:21,508 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 476 transitions. Word has length 127 [2024-11-08 17:38:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:21,508 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 476 transitions. [2024-11-08 17:38:21,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 22 states have internal predecessors, (70), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-08 17:38:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 476 transitions. [2024-11-08 17:38:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 17:38:21,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:21,510 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:21,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 17:38:21,510 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:21,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1595070282, now seen corresponding path program 1 times [2024-11-08 17:38:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:38:21,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739249099] [2024-11-08 17:38:21,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:21,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:38:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:38:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:38:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:38:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:38:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:38:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:38:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:38:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:38:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:38:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:38:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:38:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:38:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:22,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:38:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739249099] [2024-11-08 17:38:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739249099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:22,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:22,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:38:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978763558] [2024-11-08 17:38:22,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:22,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:38:22,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:38:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:38:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:38:22,421 INFO L87 Difference]: Start difference. First operand 365 states and 476 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:23,148 INFO L93 Difference]: Finished difference Result 899 states and 1163 transitions. [2024-11-08 17:38:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:38:23,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-08 17:38:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:23,152 INFO L225 Difference]: With dead ends: 899 [2024-11-08 17:38:23,152 INFO L226 Difference]: Without dead ends: 537 [2024-11-08 17:38:23,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:38:23,154 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 151 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:23,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 536 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:38:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-08 17:38:23,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 449. [2024-11-08 17:38:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 419 states have (on average 1.243436754176611) internal successors, (521), 420 states have internal predecessors, (521), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:38:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 573 transitions. [2024-11-08 17:38:23,216 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 573 transitions. Word has length 128 [2024-11-08 17:38:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:23,216 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 573 transitions. [2024-11-08 17:38:23,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 573 transitions. [2024-11-08 17:38:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 17:38:23,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:23,218 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:23,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 17:38:23,219 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:23,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1894009955, now seen corresponding path program 1 times [2024-11-08 17:38:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:38:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338809906] [2024-11-08 17:38:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:38:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:38:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:38:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:38:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:38:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:38:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:38:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:38:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:38:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:38:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:38:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:38:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:38:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:38:23,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338809906] [2024-11-08 17:38:23,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338809906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:23,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:23,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:38:23,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700010791] [2024-11-08 17:38:23,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:24,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:38:24,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:38:24,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:38:24,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:38:24,001 INFO L87 Difference]: Start difference. First operand 449 states and 573 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:24,417 INFO L93 Difference]: Finished difference Result 504 states and 637 transitions. [2024-11-08 17:38:24,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:38:24,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-08 17:38:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:24,420 INFO L225 Difference]: With dead ends: 504 [2024-11-08 17:38:24,421 INFO L226 Difference]: Without dead ends: 502 [2024-11-08 17:38:24,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:38:24,421 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 289 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:24,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 540 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:38:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-08 17:38:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2024-11-08 17:38:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 458 states have (on average 1.240174672489083) internal successors, (568), 459 states have internal predecessors, (568), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:38:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 620 transitions. [2024-11-08 17:38:24,494 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 620 transitions. Word has length 129 [2024-11-08 17:38:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:24,494 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 620 transitions. [2024-11-08 17:38:24,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 620 transitions. [2024-11-08 17:38:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 17:38:24,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:24,496 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:24,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 17:38:24,496 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:24,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1895856997, now seen corresponding path program 1 times [2024-11-08 17:38:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:38:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439545966] [2024-11-08 17:38:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:38:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:38:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:38:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:38:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:38:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:38:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:38:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:38:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:38:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:38:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:38:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:38:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:38:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:26,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:38:26,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439545966] [2024-11-08 17:38:26,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439545966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:26,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:26,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 17:38:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704804304] [2024-11-08 17:38:26,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:26,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:38:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:38:26,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:38:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:38:26,357 INFO L87 Difference]: Start difference. First operand 488 states and 620 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:27,867 INFO L93 Difference]: Finished difference Result 1126 states and 1425 transitions. [2024-11-08 17:38:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:38:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2024-11-08 17:38:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:27,871 INFO L225 Difference]: With dead ends: 1126 [2024-11-08 17:38:27,871 INFO L226 Difference]: Without dead ends: 641 [2024-11-08 17:38:27,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2024-11-08 17:38:27,873 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 370 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:27,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 891 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:38:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-08 17:38:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 551. [2024-11-08 17:38:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 521 states have (on average 1.2437619961612285) internal successors, (648), 522 states have internal predecessors, (648), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:38:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 700 transitions. [2024-11-08 17:38:27,947 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 700 transitions. Word has length 129 [2024-11-08 17:38:27,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:27,948 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 700 transitions. [2024-11-08 17:38:27,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 700 transitions. [2024-11-08 17:38:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 17:38:27,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:27,950 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:27,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 17:38:27,950 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:27,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash -624102937, now seen corresponding path program 1 times [2024-11-08 17:38:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:38:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528139315] [2024-11-08 17:38:27,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:38:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:38:28,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:38:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:38:28,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:38:28,277 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:38:28,278 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:38:28,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 17:38:28,284 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:38:28,438 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:38:28,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:38:28 BoogieIcfgContainer [2024-11-08 17:38:28,441 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:38:28,441 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:38:28,441 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:38:28,442 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:38:28,442 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:50" (3/4) ... [2024-11-08 17:38:28,449 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:38:28,450 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:38:28,451 INFO L158 Benchmark]: Toolchain (without parser) took 159186.51ms. Allocated memory was 146.8MB in the beginning and 866.1MB in the end (delta: 719.3MB). Free memory was 85.0MB in the beginning and 791.2MB in the end (delta: -706.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-08 17:38:28,451 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 146.8MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:38:28,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.56ms. Allocated memory is still 146.8MB. Free memory was 84.7MB in the beginning and 106.4MB in the end (delta: -21.8MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-08 17:38:28,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.29ms. Allocated memory is still 146.8MB. Free memory was 106.4MB in the beginning and 101.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:38:28,455 INFO L158 Benchmark]: Boogie Preprocessor took 100.08ms. Allocated memory is still 146.8MB. Free memory was 101.8MB in the beginning and 98.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:38:28,456 INFO L158 Benchmark]: RCFGBuilder took 983.60ms. Allocated memory is still 146.8MB. Free memory was 98.1MB in the beginning and 109.0MB in the end (delta: -11.0MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-11-08 17:38:28,456 INFO L158 Benchmark]: TraceAbstraction took 157535.21ms. Allocated memory was 146.8MB in the beginning and 866.1MB in the end (delta: 719.3MB). Free memory was 108.3MB in the beginning and 792.2MB in the end (delta: -684.0MB). Peak memory consumption was 516.1MB. Max. memory is 16.1GB. [2024-11-08 17:38:28,456 INFO L158 Benchmark]: Witness Printer took 9.06ms. Allocated memory is still 866.1MB. Free memory was 792.2MB in the beginning and 791.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:38:28,461 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.30ms. Allocated memory is still 146.8MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.56ms. Allocated memory is still 146.8MB. Free memory was 84.7MB in the beginning and 106.4MB in the end (delta: -21.8MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.29ms. Allocated memory is still 146.8MB. Free memory was 106.4MB in the beginning and 101.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.08ms. Allocated memory is still 146.8MB. Free memory was 101.8MB in the beginning and 98.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 983.60ms. Allocated memory is still 146.8MB. Free memory was 98.1MB in the beginning and 109.0MB in the end (delta: -11.0MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * TraceAbstraction took 157535.21ms. Allocated memory was 146.8MB in the beginning and 866.1MB in the end (delta: 719.3MB). Free memory was 108.3MB in the beginning and 792.2MB in the end (delta: -684.0MB). Peak memory consumption was 516.1MB. Max. memory is 16.1GB. * Witness Printer took 9.06ms. Allocated memory is still 866.1MB. Free memory was 792.2MB in the beginning and 791.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L55] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] unsigned short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L59] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L60] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L61] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L62] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L67] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L68] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=0] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L94] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_9 [L101] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_9 [L101] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L103] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L104] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_11 [L105] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_11 [L105] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L105] EXPR (WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_12 [L107] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_12 [L107] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L107] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L108] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L111] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L126] RET updateVariables() [L127] CALL step() [L72] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L72] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L73] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L73] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L74] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L74] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L77] (*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L77] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) [L80] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L80] unsigned short int stepLocal_0 = (*(WrapperStruct00_var_1_4_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=-49153] [L81] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=-49153] [L81] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=-49153] [L81] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=-49153] [L81] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_0=-49153] [L81] COND FALSE !(stepLocal_0 <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) [L84] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] (*(WrapperStruct00_var_1_7_Pointer)) = ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))) [L86] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L86] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_13_Pointer)); [L87] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, stepLocal_1=-256] [L87] COND FALSE !((*(WrapperStruct00_var_1_13_Pointer)) < stepLocal_1) [L90] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L90] (*(WrapperStruct00_var_1_8_Pointer)) = (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1) [L118] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer))))))) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))) [L118] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L118] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer)))))) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) [L118] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L118] EXPR ((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L118-L119] return ((((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((17222 - (*(WrapperStruct00_var_1_13_Pointer))) + (((((29916) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (29916) : ((*(WrapperStruct00_var_1_4_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer)))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) >= ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed char) 8)) : 1)) && (((*(WrapperStruct00_var_1_4_Pointer)) <= (((((*(WrapperStruct00_var_1_13_Pointer))) > (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) << (*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + ((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_4_Pointer)))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((double) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:34}, WrapperStruct00_var_1_12_Pointer={4:42}, WrapperStruct00_var_1_13_Pointer={4:50}, WrapperStruct00_var_1_14_Pointer={4:51}, WrapperStruct00_var_1_15_Pointer={4:52}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_4_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:5}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 157.3s, OverallIterations: 33, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 79.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6803 SdHoareTripleChecker+Valid, 41.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6792 mSDsluCounter, 22526 SdHoareTripleChecker+Invalid, 39.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17996 mSDsCounter, 299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15187 IncrementalHoareTripleChecker+Invalid, 15486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299 mSolverCounterUnsat, 4530 mSDtfsCounter, 15187 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1306 GetRequests, 880 SyntacticMatches, 4 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2013 ImplicationChecksByTransitivity, 60.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=32, InterpolantAutomatonStates: 294, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 32 MinimizatonAttempts, 1251 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 72.6s InterpolantComputationTime, 4048 NumberOfCodeBlocks, 4048 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3887 ConstructedInterpolants, 0 QuantifiedInterpolants, 51373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 8448/8448 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:38:28,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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_51b997e8-8931-402c-be86-6506afcc02fb/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 d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:38:30,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:38:31,007 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:38:31,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:38:31,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:38:31,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:38:31,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:38:31,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:38:31,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:38:31,051 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:38:31,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:38:31,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:38:31,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:38:31,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:38:31,056 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:38:31,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:38:31,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:38:31,057 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:38:31,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:38:31,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:38:31,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:38:31,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:38:31,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:38:31,063 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:38:31,063 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:38:31,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:38:31,063 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:38:31,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:38:31,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:38:31,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:38:31,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:38:31,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:38:31,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:38:31,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:38:31,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:38:31,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:38:31,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:38:31,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:38:31,069 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:38:31,069 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:38:31,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:38:31,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:38:31,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:38:31,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:38:31,070 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_51b997e8-8931-402c-be86-6506afcc02fb/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_51b997e8-8931-402c-be86-6506afcc02fb/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 -> d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 [2024-11-08 17:38:31,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:38:31,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:38:31,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:38:31,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:38:31,496 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:38:31,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i Unable to find full path for "g++" [2024-11-08 17:38:33,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:38:34,003 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:38:34,006 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-08 17:38:34,019 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/data/aab3d3e60/8b56bf73d3b3492f980d480fb093ce6b/FLAG8d4d74e57 [2024-11-08 17:38:34,038 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/data/aab3d3e60/8b56bf73d3b3492f980d480fb093ce6b [2024-11-08 17:38:34,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:38:34,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:38:34,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:38:34,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:38:34,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:38:34,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c76778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34, skipping insertion in model container [2024-11-08 17:38:34,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:38:34,270 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_51b997e8-8931-402c-be86-6506afcc02fb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2024-11-08 17:38:34,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:38:34,427 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:38:34,445 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_51b997e8-8931-402c-be86-6506afcc02fb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2024-11-08 17:38:34,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:38:34,557 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:38:34,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34 WrapperNode [2024-11-08 17:38:34,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:38:34,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:38:34,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:38:34,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:38:34,568 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:38:34" (1/1) ... [2024-11-08 17:38:34,591 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:38:34" (1/1) ... [2024-11-08 17:38:34,648 INFO L138 Inliner]: procedures = 37, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2024-11-08 17:38:34,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:38:34,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:38:34,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:38:34,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:38:34,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,702 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-08 17:38:34,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:38:34,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:38:34,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:38:34,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:38:34,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34" (1/1) ... [2024-11-08 17:38:34,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:38:34,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:38:34,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:34,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:38:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 17:38:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 17:38:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-08 17:38:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-08 17:38:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 17:38:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 17:38:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:38:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:38:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:38:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:38:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:38:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:38:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 17:38:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 17:38:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 17:38:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 17:38:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 17:38:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 17:38:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 17:38:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 17:38:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:38:34,837 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:38:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:38:34,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:38:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:38:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:38:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 17:38:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 17:38:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:38:34,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:38:34,998 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:38:35,001 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:38:38,641 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-11-08 17:38:38,642 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:38:38,655 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:38:38,656 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:38:38,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:38:38 BoogieIcfgContainer [2024-11-08 17:38:38,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:38:38,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:38:38,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:38:38,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:38:38,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:38:34" (1/3) ... [2024-11-08 17:38:38,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a28933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:38:38, skipping insertion in model container [2024-11-08 17:38:38,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:38:34" (2/3) ... [2024-11-08 17:38:38,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a28933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:38:38, skipping insertion in model container [2024-11-08 17:38:38,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:38:38" (3/3) ... [2024-11-08 17:38:38,665 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-08 17:38:38,683 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:38:38,684 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:38:38,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:38:38,777 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;@67e07fbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:38:38,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:38:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:38:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 17:38:38,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:38,795 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:38,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:38,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:38,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1015447861, now seen corresponding path program 1 times [2024-11-08 17:38:38,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:38:38,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953736773] [2024-11-08 17:38:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:38,818 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:38:38,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:38:38,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:38,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:39,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:38:39,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:38:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-08 17:38:39,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:38:39,422 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:38:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953736773] [2024-11-08 17:38:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953736773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:39,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:39,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:38:39,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096183039] [2024-11-08 17:38:39,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:39,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:38:39,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:38:39,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:38:39,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:38:39,470 INFO L87 Difference]: Start difference. First operand has 101 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:38:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:39,499 INFO L93 Difference]: Finished difference Result 195 states and 302 transitions. [2024-11-08 17:38:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:38:39,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-08 17:38:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:39,509 INFO L225 Difference]: With dead ends: 195 [2024-11-08 17:38:39,509 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 17:38:39,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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:38:39,516 INFO L432 NwaCegarLoop]: 141 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, 141 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:38:39,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:38:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 17:38:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-08 17:38:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:38:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-08 17:38:39,568 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 115 [2024-11-08 17:38:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:39,569 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-08 17:38:39,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:38:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-08 17:38:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 17:38:39,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:39,578 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:39,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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)] Ended with exit code 0 [2024-11-08 17:38:39,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:39,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:39,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1553236539, now seen corresponding path program 1 times [2024-11-08 17:38:39,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:38:39,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019183285] [2024-11-08 17:38:39,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:39,781 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:38:39,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:38:39,784 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:39,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:40,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:38:40,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:38:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:40,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:38:40,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:38:40,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019183285] [2024-11-08 17:38:40,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019183285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:40,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:40,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:38:40,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409400335] [2024-11-08 17:38:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:40,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:38:40,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:38:40,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:38:40,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:38:40,365 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:41,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s 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:38:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:44,762 INFO L93 Difference]: Finished difference Result 202 states and 296 transitions. [2024-11-08 17:38:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:38:44,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-08 17:38:44,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:44,766 INFO L225 Difference]: With dead ends: 202 [2024-11-08 17:38:44,766 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 17:38:44,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:38:44,768 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 13 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:44,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 402 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-08 17:38:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 17:38:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2024-11-08 17:38:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:38:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2024-11-08 17:38:44,782 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 115 [2024-11-08 17:38:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:44,784 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2024-11-08 17:38:44,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:44,785 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2024-11-08 17:38:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 17:38:44,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:44,787 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:44,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:38:44,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:44,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:44,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash -33347077, now seen corresponding path program 1 times [2024-11-08 17:38:44,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:38:44,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579033772] [2024-11-08 17:38:44,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:44,990 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:38:44,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:38:44,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:44,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:45,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:38:45,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:38:45,514 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 17 treesize of output 9 [2024-11-08 17:38:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:45,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:38:45,567 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:38:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579033772] [2024-11-08 17:38:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579033772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:45,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:45,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:38:45,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560594554] [2024-11-08 17:38:45,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:45,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:38:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:38:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:38:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:38:45,595 INFO L87 Difference]: Start difference. First operand 100 states and 144 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:46,809 INFO L93 Difference]: Finished difference Result 197 states and 285 transitions. [2024-11-08 17:38:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:38:46,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-08 17:38:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:46,812 INFO L225 Difference]: With dead ends: 197 [2024-11-08 17:38:46,812 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 17:38:46,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:38:46,814 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:46,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:38:46,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 17:38:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-08 17:38:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:38:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2024-11-08 17:38:46,826 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 115 [2024-11-08 17:38:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:46,827 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2024-11-08 17:38:46,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2024-11-08 17:38:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 17:38:46,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:46,829 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:46,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:47,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:47,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:47,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:47,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1621694979, now seen corresponding path program 1 times [2024-11-08 17:38:47,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:38:47,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421964129] [2024-11-08 17:38:47,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:47,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:38:47,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:38:47,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:47,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:47,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:38:47,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:38:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:47,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:38:47,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:38:47,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421964129] [2024-11-08 17:38:47,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421964129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:47,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:47,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:38:47,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756610827] [2024-11-08 17:38:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:47,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:38:47,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:38:47,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:38:47,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:38:47,609 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:47,669 INFO L93 Difference]: Finished difference Result 199 states and 286 transitions. [2024-11-08 17:38:47,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:38:47,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-08 17:38:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:47,671 INFO L225 Difference]: With dead ends: 199 [2024-11-08 17:38:47,672 INFO L226 Difference]: Without dead ends: 102 [2024-11-08 17:38:47,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 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:38:47,677 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 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:38:47,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:38:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-08 17:38:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-08 17:38:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:38:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2024-11-08 17:38:47,699 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 115 [2024-11-08 17:38:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:47,702 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2024-11-08 17:38:47,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2024-11-08 17:38:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 17:38:47,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:47,705 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:47,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:38:47,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:47,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:47,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash 827847032, now seen corresponding path program 1 times [2024-11-08 17:38:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:38:47,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189534924] [2024-11-08 17:38:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:47,907 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:38:47,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:38:47,911 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:47,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:48,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:38:48,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:38:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:48,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:38:48,528 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:38:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189534924] [2024-11-08 17:38:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189534924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:48,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:48,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:38:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817268304] [2024-11-08 17:38:48,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:48,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:38:48,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:38:48,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:38:48,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:38:48,535 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:48,691 INFO L93 Difference]: Finished difference Result 208 states and 297 transitions. [2024-11-08 17:38:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:38:48,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-08 17:38:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:48,694 INFO L225 Difference]: With dead ends: 208 [2024-11-08 17:38:48,694 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 17:38:48,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:38:48,700 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:48,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 644 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:38:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 17:38:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-08 17:38:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:38:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 151 transitions. [2024-11-08 17:38:48,717 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 151 transitions. Word has length 117 [2024-11-08 17:38:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:48,722 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 151 transitions. [2024-11-08 17:38:48,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 151 transitions. [2024-11-08 17:38:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 17:38:48,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:48,724 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:48,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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)] Ended with exit code 0 [2024-11-08 17:38:48,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:48,925 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1692112902, now seen corresponding path program 1 times [2024-11-08 17:38:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:38:48,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394456105] [2024-11-08 17:38:48,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:48,926 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:38:48,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:38:48,930 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:48,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:49,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:38:49,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:38:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:38:49,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:38:49,566 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:38:49,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394456105] [2024-11-08 17:38:49,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394456105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:49,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:49,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:38:49,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680471341] [2024-11-08 17:38:49,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:49,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:38:49,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:38:49,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:38:49,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:38:49,575 INFO L87 Difference]: Start difference. First operand 108 states and 151 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:49,772 INFO L93 Difference]: Finished difference Result 216 states and 303 transitions. [2024-11-08 17:38:49,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:38:49,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-08 17:38:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:49,775 INFO L225 Difference]: With dead ends: 216 [2024-11-08 17:38:49,775 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 17:38:49,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:38:49,777 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:49,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 766 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:38:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 17:38:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 17:38:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.34375) internal successors, (129), 96 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:38:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2024-11-08 17:38:49,785 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 117 [2024-11-08 17:38:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:49,786 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2024-11-08 17:38:49,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:38:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2024-11-08 17:38:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 17:38:49,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:49,788 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:49,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:49,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:49,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:49,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1690265860, now seen corresponding path program 1 times [2024-11-08 17:38:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:38:49,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665040240] [2024-11-08 17:38:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:49,991 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:38:49,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:38:49,994 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:49,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:50,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:38:50,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:38:50,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:38:50,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 17:38:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-08 17:38:51,006 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:38:51,006 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:38:51,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665040240] [2024-11-08 17:38:51,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665040240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:51,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:51,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:38:51,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549267817] [2024-11-08 17:38:51,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:51,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:38:51,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:38:51,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:38:51,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:38:51,013 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:38:52,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s 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:38:56,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:38:56,746 INFO L93 Difference]: Finished difference Result 218 states and 304 transitions. [2024-11-08 17:38:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:38:56,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-08 17:38:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:38:56,749 INFO L225 Difference]: With dead ends: 218 [2024-11-08 17:38:56,749 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 17:38:56,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:38:56,754 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 119 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:38:56,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 401 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-08 17:38:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 17:38:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 17:38:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:38:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2024-11-08 17:38:56,769 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 117 [2024-11-08 17:38:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:38:56,770 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2024-11-08 17:38:56,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:38:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2024-11-08 17:38:56,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:38:56,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:38:56,772 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:56,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:56,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:38:56,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:38:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1350525398, now seen corresponding path program 1 times [2024-11-08 17:38:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:38:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124700272] [2024-11-08 17:38:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:38:56,977 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:38:56,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:38:56,978 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:56,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:38:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:38:57,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:38:57,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:38:57,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:38:57,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 17:38:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 17:38:57,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:38:57,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:38:57,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124700272] [2024-11-08 17:38:57,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124700272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:38:57,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:38:57,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:38:57,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720891214] [2024-11-08 17:38:57,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:38:57,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:38:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:38:57,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:38:57,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:38:57,912 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:38:59,626 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:39:01,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:39:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:39:03,306 INFO L93 Difference]: Finished difference Result 218 states and 302 transitions. [2024-11-08 17:39:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:39:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-08 17:39:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:39:03,308 INFO L225 Difference]: With dead ends: 218 [2024-11-08 17:39:03,308 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 17:39:03,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:39:03,309 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 111 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:39:03,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 397 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-08 17:39:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 17:39:03,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 17:39:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:39:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 151 transitions. [2024-11-08 17:39:03,316 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 151 transitions. Word has length 119 [2024-11-08 17:39:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:39:03,317 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 151 transitions. [2024-11-08 17:39:03,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:39:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 151 transitions. [2024-11-08 17:39:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 17:39:03,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:39:03,320 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:03,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:03,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:03,521 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:39:03,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:39:03,522 INFO L85 PathProgramCache]: Analyzing trace with hash 15076156, now seen corresponding path program 1 times [2024-11-08 17:39:03,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:39:03,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768210611] [2024-11-08 17:39:03,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:39:03,523 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:39:03,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:39:03,532 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:03,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:39:04,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:39:04,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:39:04,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:39:04,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 67 [2024-11-08 17:39:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 17:39:04,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:39:04,640 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:39:04,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768210611] [2024-11-08 17:39:04,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768210611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:39:04,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:39:04,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:39:04,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397340263] [2024-11-08 17:39:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:39:04,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:39:04,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:39:04,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:39:04,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:39:04,644 INFO L87 Difference]: Start difference. First operand 110 states and 151 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:39:06,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s 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:39:08,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:39:12,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:39:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:39:12,297 INFO L93 Difference]: Finished difference Result 218 states and 300 transitions. [2024-11-08 17:39:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:39:12,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-08 17:39:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:39:12,299 INFO L225 Difference]: With dead ends: 218 [2024-11-08 17:39:12,299 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 17:39:12,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:39:12,300 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 102 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:39:12,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 393 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-08 17:39:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 17:39:12,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 17:39:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:39:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 150 transitions. [2024-11-08 17:39:12,307 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 150 transitions. Word has length 121 [2024-11-08 17:39:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:39:12,308 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 150 transitions. [2024-11-08 17:39:12,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:39:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 150 transitions. [2024-11-08 17:39:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 17:39:12,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:39:12,310 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:12,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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)] Ended with exit code 0 [2024-11-08 17:39:12,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:12,514 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:39:12,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:39:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1242432490, now seen corresponding path program 1 times [2024-11-08 17:39:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:39:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029440194] [2024-11-08 17:39:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:39:12,516 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:39:12,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:39:12,522 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:12,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:39:13,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:39:13,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:39:13,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:39:13,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 17:39:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 17:39:13,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:39:13,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:39:13,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029440194] [2024-11-08 17:39:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029440194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:39:13,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:39:13,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:39:13,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123907317] [2024-11-08 17:39:13,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:39:13,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:39:13,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:39:13,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:39:13,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:39:13,458 INFO L87 Difference]: Start difference. First operand 110 states and 150 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:39:14,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s 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:39:16,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:39:19,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:39:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:39:19,819 INFO L93 Difference]: Finished difference Result 218 states and 298 transitions. [2024-11-08 17:39:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:39:19,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2024-11-08 17:39:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:39:19,821 INFO L225 Difference]: With dead ends: 218 [2024-11-08 17:39:19,821 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 17:39:19,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:39:19,823 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 92 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:39:19,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 387 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-08 17:39:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 17:39:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 17:39:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 96 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:39:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2024-11-08 17:39:19,830 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 123 [2024-11-08 17:39:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:39:19,831 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2024-11-08 17:39:19,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 17:39:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2024-11-08 17:39:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:39:19,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:39:19,833 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:19,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:39:20,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:20,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:39:20,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:39:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1994442298, now seen corresponding path program 1 times [2024-11-08 17:39:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:39:20,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535900500] [2024-11-08 17:39:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:39:20,035 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:39:20,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:39:20,036 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:20,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:39:20,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:39:20,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:39:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-08 17:39:20,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:39:20,610 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:39:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535900500] [2024-11-08 17:39:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535900500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:39:20,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:39:20,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:39:20,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899244243] [2024-11-08 17:39:20,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:39:20,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:39:20,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:39:20,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:39:20,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:39:20,613 INFO L87 Difference]: Start difference. First operand 110 states and 149 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 17:39:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:39:20,877 INFO L93 Difference]: Finished difference Result 221 states and 300 transitions. [2024-11-08 17:39:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:39:20,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2024-11-08 17:39:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:39:20,880 INFO L225 Difference]: With dead ends: 221 [2024-11-08 17:39:20,880 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 17:39:20,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:39:20,881 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:39:20,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 569 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:39:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 17:39:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2024-11-08 17:39:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 96 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:39:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2024-11-08 17:39:20,889 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 125 [2024-11-08 17:39:20,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:39:20,890 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2024-11-08 17:39:20,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 17:39:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2024-11-08 17:39:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:39:20,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:39:20,891 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:20,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:21,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:21,092 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:39:21,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:39:21,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1792618364, now seen corresponding path program 1 times [2024-11-08 17:39:21,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:39:21,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111137093] [2024-11-08 17:39:21,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:39:21,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:39:21,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:39:21,095 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:21,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:39:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:39:21,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 17:39:21,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:39:22,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 17:39:24,144 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:39:25,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2024-11-08 17:39:30,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2024-11-08 17:39:40,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2024-11-08 17:39:53,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 65 [2024-11-08 17:40:11,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-08 17:40:13,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-08 17:40:30,767 INFO L349 Elim1Store]: treesize reduction 118, result has 15.7 percent of original size [2024-11-08 17:40:30,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 99 [2024-11-08 17:40:31,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 79 [2024-11-08 17:40:32,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:40:32,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 80 treesize of output 79 [2024-11-08 17:40:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 139 proven. 104 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 17:40:32,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:41:00,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:41:00,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111137093] [2024-11-08 17:41:00,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111137093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:41:00,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126117575] [2024-11-08 17:41:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:41:00,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:41:00,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:41:00,679 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:41:00,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 17:41:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:41:01,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 17:41:01,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:41:04,704 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 24 treesize of output 12 [2024-11-08 17:41:04,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-11-08 17:41:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:41:05,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:41:05,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126117575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:41:05,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:41:05,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2024-11-08 17:41:05,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810017166] [2024-11-08 17:41:05,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:41:05,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:41:05,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:41:05,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:41:05,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=550, Unknown=19, NotChecked=0, Total=702 [2024-11-08 17:41:05,081 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:41:06,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s 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:41:09,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:41:12,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:41:15,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:41:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:41:16,690 INFO L93 Difference]: Finished difference Result 261 states and 351 transitions. [2024-11-08 17:41:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:41:16,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-08 17:41:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:41:16,693 INFO L225 Difference]: With dead ends: 261 [2024-11-08 17:41:16,693 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 17:41:16,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 86.6s TimeCoverageRelationStatistics Valid=145, Invalid=592, Unknown=19, NotChecked=0, Total=756 [2024-11-08 17:41:16,695 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 115 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:41:16,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 392 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-11-08 17:41:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 17:41:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2024-11-08 17:41:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:41:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions. [2024-11-08 17:41:16,705 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 161 transitions. Word has length 125 [2024-11-08 17:41:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:41:16,706 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 161 transitions. [2024-11-08 17:41:16,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:41:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2024-11-08 17:41:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 17:41:16,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:41:16,708 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 17:41:16,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:41:17,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:17,109 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:41:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:41:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1616186718, now seen corresponding path program 1 times [2024-11-08 17:41:17,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:41:17,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941452075] [2024-11-08 17:41:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:41:17,110 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:17,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:41:17,111 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:17,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:41:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:41:17,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:41:17,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:41:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:41:17,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:41:17,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:41:17,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941452075] [2024-11-08 17:41:17,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941452075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:41:17,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:41:17,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:41:17,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818632360] [2024-11-08 17:41:17,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:41:17,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:41:17,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:41:17,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:41:17,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:41:17,677 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:41:19,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s 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:41:21,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:41:24,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:41:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:41:24,159 INFO L93 Difference]: Finished difference Result 270 states and 363 transitions. [2024-11-08 17:41:24,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:41:24,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-08 17:41:24,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:41:24,161 INFO L225 Difference]: With dead ends: 270 [2024-11-08 17:41:24,161 INFO L226 Difference]: Without dead ends: 153 [2024-11-08 17:41:24,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:41:24,162 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 37 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:41:24,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 369 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-08 17:41:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-08 17:41:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 122. [2024-11-08 17:41:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:41:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2024-11-08 17:41:24,172 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 163 transitions. Word has length 126 [2024-11-08 17:41:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:41:24,173 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 163 transitions. [2024-11-08 17:41:24,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:41:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 163 transitions. [2024-11-08 17:41:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 17:41:24,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:41:24,175 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:41:24,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:24,375 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:41:24,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:41:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash 387799650, now seen corresponding path program 1 times [2024-11-08 17:41:24,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:41:24,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884449344] [2024-11-08 17:41:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:41:24,376 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:24,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:41:24,378 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:24,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:41:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:41:24,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:41:24,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:41:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:41:24,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:41:24,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:41:24,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884449344] [2024-11-08 17:41:24,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884449344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:41:24,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:41:24,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:41:24,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961374821] [2024-11-08 17:41:24,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:41:24,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:41:24,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:41:24,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:41:24,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:41:24,936 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:41:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:41:25,038 INFO L93 Difference]: Finished difference Result 244 states and 327 transitions. [2024-11-08 17:41:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:41:25,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-08 17:41:25,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:41:25,040 INFO L225 Difference]: With dead ends: 244 [2024-11-08 17:41:25,040 INFO L226 Difference]: Without dead ends: 125 [2024-11-08 17:41:25,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 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:41:25,041 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 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:41:25,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:41:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-08 17:41:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-08 17:41:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 111 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 17:41:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2024-11-08 17:41:25,050 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 126 [2024-11-08 17:41:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:41:25,051 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2024-11-08 17:41:25,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 17:41:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2024-11-08 17:41:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 17:41:25,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:41:25,052 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:41:25,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:25,253 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:41:25,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:41:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash 523170103, now seen corresponding path program 1 times [2024-11-08 17:41:25,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:41:25,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201214078] [2024-11-08 17:41:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:41:25,254 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:25,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:41:25,257 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:25,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:41:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:41:26,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 17:41:26,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:41:27,219 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:41:28,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-08 17:41:33,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2024-11-08 17:41:34,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2024-11-08 17:41:35,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2024-11-08 17:41:45,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2024-11-08 17:41:46,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-08 17:41:48,209 INFO L349 Elim1Store]: treesize reduction 41, result has 30.5 percent of original size [2024-11-08 17:41:48,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 84 [2024-11-08 17:41:48,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:41:48,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201214078] [2024-11-08 17:41:48,445 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-08 17:41:48,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:41:48,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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:48,646 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-08 17:41:48,650 INFO L158 Benchmark]: Toolchain (without parser) took 194608.37ms. Allocated memory was 65.0MB in the beginning and 109.1MB in the end (delta: 44.0MB). Free memory was 40.9MB in the beginning and 57.4MB in the end (delta: -16.5MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2024-11-08 17:41:48,650 INFO L158 Benchmark]: CDTParser took 1.31ms. Allocated memory is still 65.0MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:41:48,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.13ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 40.7MB in the beginning and 63.0MB in the end (delta: -22.3MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-11-08 17:41:48,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.19ms. Allocated memory is still 90.2MB. Free memory was 63.0MB in the beginning and 59.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:41:48,651 INFO L158 Benchmark]: Boogie Preprocessor took 100.96ms. Allocated memory is still 90.2MB. Free memory was 59.6MB in the beginning and 54.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:41:48,651 INFO L158 Benchmark]: RCFGBuilder took 3905.56ms. Allocated memory is still 90.2MB. Free memory was 54.4MB in the beginning and 58.4MB in the end (delta: -4.0MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-08 17:41:48,652 INFO L158 Benchmark]: TraceAbstraction took 189990.90ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 154.2kB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2024-11-08 17:41:48,654 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31ms. Allocated memory is still 65.0MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.13ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 40.7MB in the beginning and 63.0MB in the end (delta: -22.3MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.19ms. Allocated memory is still 90.2MB. Free memory was 63.0MB in the beginning and 59.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.96ms. Allocated memory is still 90.2MB. Free memory was 59.6MB in the beginning and 54.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 3905.56ms. Allocated memory is still 90.2MB. Free memory was 54.4MB in the beginning and 58.4MB in the end (delta: -4.0MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 189990.90ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 154.2kB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-08 17:41:48,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51b997e8-8931-402c-be86-6506afcc02fb/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 Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no need to replace index