./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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_2c647db2-6cc6-4b63-b868-67031fbaeb34/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 ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:12:18,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:12:18,686 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:12:18,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:12:18,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:12:18,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:12:18,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:12:18,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:12:18,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:12:18,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:12:18,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:12:18,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:12:18,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:12:18,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:12:18,730 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:12:18,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:12:18,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:12:18,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:12:18,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:12:18,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:12:18,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:12:18,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:12:18,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:12:18,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:12:18,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:12:18,737 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:12:18,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:12:18,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:12:18,738 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:12:18,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:12:18,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:12:18,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:12:18,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:12:18,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:12:18,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:12:18,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:12:18,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:12:18,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:12:18,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:12:18,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:12:18,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:12:18,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:12:18,767 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_2c647db2-6cc6-4b63-b868-67031fbaeb34/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_2c647db2-6cc6-4b63-b868-67031fbaeb34/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 -> ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb [2024-11-08 17:12:19,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:12:19,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:12:19,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:12:19,181 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:12:19,182 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:12:19,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i Unable to find full path for "g++" [2024-11-08 17:12:21,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:12:21,989 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:12:21,990 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i [2024-11-08 17:12:22,013 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/data/fed431148/ebfbec20b6c149d69e0d8ed1810fbcaa/FLAGc30d31218 [2024-11-08 17:12:22,043 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/data/fed431148/ebfbec20b6c149d69e0d8ed1810fbcaa [2024-11-08 17:12:22,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:12:22,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:12:22,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:12:22,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:12:22,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:12:22,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba27055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22, skipping insertion in model container [2024-11-08 17:12:22,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:12:22,406 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_2c647db2-6cc6-4b63-b868-67031fbaeb34/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i[916,929] [2024-11-08 17:12:22,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:12:22,540 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:12:22,554 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_2c647db2-6cc6-4b63-b868-67031fbaeb34/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i[916,929] [2024-11-08 17:12:22,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:12:22,675 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:12:22,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22 WrapperNode [2024-11-08 17:12:22,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:12:22,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:12:22,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:12:22,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:12:22,694 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:12:22" (1/1) ... [2024-11-08 17:12:22,713 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:12:22" (1/1) ... [2024-11-08 17:12:22,775 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 262 [2024-11-08 17:12:22,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:12:22,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:12:22,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:12:22,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:12:22,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,824 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:12:22,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:12:22,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:12:22,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:12:22,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:12:22,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22" (1/1) ... [2024-11-08 17:12:22,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:12:22,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:12:22,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:12:22,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:12:22,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:12:22,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:12:22,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:12:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:12:22,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:12:22,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:12:23,157 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:12:23,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:12:23,962 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-08 17:12:23,962 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:12:23,989 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:12:23,989 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:12:23,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:23 BoogieIcfgContainer [2024-11-08 17:12:23,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:12:23,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:12:23,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:12:23,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:12:23,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:12:22" (1/3) ... [2024-11-08 17:12:24,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8252a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:24, skipping insertion in model container [2024-11-08 17:12:24,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:22" (2/3) ... [2024-11-08 17:12:24,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8252a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:24, skipping insertion in model container [2024-11-08 17:12:24,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:23" (3/3) ... [2024-11-08 17:12:24,004 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-15.i [2024-11-08 17:12:24,033 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:12:24,033 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:12:24,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:12:24,190 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;@628d9d14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:12:24,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:12:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:12:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 17:12:24,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:24,215 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:24,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:24,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash 469663756, now seen corresponding path program 1 times [2024-11-08 17:12:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:24,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158262446] [2024-11-08 17:12:24,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:12:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:12:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:12:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:12:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:12:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:12:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:12:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:12:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:12:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:12:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:12:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:12:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:12:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:12:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:12:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:12:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:12:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:12:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:12:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:12:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 17:12:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 17:12:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 17:12:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:12:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 17:12:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 17:12:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 17:12:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 17:12:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 17:12:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158262446] [2024-11-08 17:12:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158262446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:24,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:24,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:12:24,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155178880] [2024-11-08 17:12:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:24,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:12:25,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:25,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:12:25,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:12:25,034 INFO L87 Difference]: Start difference. First operand has 113 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 17:12:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:25,084 INFO L93 Difference]: Finished difference Result 219 states and 374 transitions. [2024-11-08 17:12:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:12:25,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 188 [2024-11-08 17:12:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:25,101 INFO L225 Difference]: With dead ends: 219 [2024-11-08 17:12:25,103 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 17:12:25,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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:12:25,113 INFO L432 NwaCegarLoop]: 169 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, 169 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:12:25,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:12:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 17:12:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-08 17:12:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 79 states have internal predecessors, (113), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:12:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 169 transitions. [2024-11-08 17:12:25,183 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 169 transitions. Word has length 188 [2024-11-08 17:12:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:25,186 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 169 transitions. [2024-11-08 17:12:25,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 17:12:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 169 transitions. [2024-11-08 17:12:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 17:12:25,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:25,193 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:25,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:12:25,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:25,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1259620972, now seen corresponding path program 1 times [2024-11-08 17:12:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:25,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289485602] [2024-11-08 17:12:25,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:25,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:12:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:12:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:12:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:12:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:12:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:12:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:12:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:12:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:12:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:12:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:12:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:12:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:12:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:12:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:12:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:12:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:12:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:12:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:12:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:12:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 17:12:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 17:12:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 17:12:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:12:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 17:12:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 17:12:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 17:12:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 17:12:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 17:12:25,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:25,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289485602] [2024-11-08 17:12:25,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289485602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:25,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:25,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191783425] [2024-11-08 17:12:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:25,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:25,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:25,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:25,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:25,910 INFO L87 Difference]: Start difference. First operand 109 states and 169 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:26,094 INFO L93 Difference]: Finished difference Result 316 states and 491 transitions. [2024-11-08 17:12:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:26,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-11-08 17:12:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:26,101 INFO L225 Difference]: With dead ends: 316 [2024-11-08 17:12:26,105 INFO L226 Difference]: Without dead ends: 210 [2024-11-08 17:12:26,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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:12:26,112 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 150 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:26,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 457 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:12:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-08 17:12:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 136. [2024-11-08 17:12:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.4528301886792452) internal successors, (154), 106 states have internal predecessors, (154), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:12:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 210 transitions. [2024-11-08 17:12:26,170 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 210 transitions. Word has length 188 [2024-11-08 17:12:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:26,173 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 210 transitions. [2024-11-08 17:12:26,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 210 transitions. [2024-11-08 17:12:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 17:12:26,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:26,185 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:26,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:12:26,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:26,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:26,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1119072362, now seen corresponding path program 1 times [2024-11-08 17:12:26,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:26,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98965715] [2024-11-08 17:12:26,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:26,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:12:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:12:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:12:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:12:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:12:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:12:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:12:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:12:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:12:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:12:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:12:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:12:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:12:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:12:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:12:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:12:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:12:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:12:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:12:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:12:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 17:12:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 17:12:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 17:12:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:12:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 17:12:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 17:12:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 17:12:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 17:12:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 17:12:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:26,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98965715] [2024-11-08 17:12:26,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98965715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:26,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:26,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:26,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539685177] [2024-11-08 17:12:26,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:26,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:26,713 INFO L87 Difference]: Start difference. First operand 136 states and 210 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:26,944 INFO L93 Difference]: Finished difference Result 402 states and 624 transitions. [2024-11-08 17:12:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:26,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-11-08 17:12:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:26,956 INFO L225 Difference]: With dead ends: 402 [2024-11-08 17:12:26,956 INFO L226 Difference]: Without dead ends: 269 [2024-11-08 17:12:26,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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:12:26,959 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 144 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:26,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 374 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:12:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-08 17:12:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 207. [2024-11-08 17:12:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 177 states have (on average 1.497175141242938) internal successors, (265), 177 states have internal predecessors, (265), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:12:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 321 transitions. [2024-11-08 17:12:27,008 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 321 transitions. Word has length 188 [2024-11-08 17:12:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:27,013 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 321 transitions. [2024-11-08 17:12:27,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 321 transitions. [2024-11-08 17:12:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 17:12:27,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:27,018 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:27,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:12:27,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:27,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash -390438802, now seen corresponding path program 1 times [2024-11-08 17:12:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:27,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243313998] [2024-11-08 17:12:27,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:12:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:12:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:12:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:12:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:12:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:12:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:12:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:12:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:12:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:12:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:12:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:12:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:12:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:12:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:12:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:12:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:12:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:12:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:12:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:12:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 17:12:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 17:12:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 17:12:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:12:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 17:12:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 17:12:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 17:12:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 17:12:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 17:12:27,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:27,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243313998] [2024-11-08 17:12:27,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243313998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:27,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:27,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:12:27,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020513657] [2024-11-08 17:12:27,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:27,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:12:27,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:27,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:12:27,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:12:27,538 INFO L87 Difference]: Start difference. First operand 207 states and 321 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:27,786 INFO L93 Difference]: Finished difference Result 557 states and 863 transitions. [2024-11-08 17:12:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:12:27,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-08 17:12:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:27,791 INFO L225 Difference]: With dead ends: 557 [2024-11-08 17:12:27,791 INFO L226 Difference]: Without dead ends: 353 [2024-11-08 17:12:27,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:12:27,794 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 136 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:27,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 314 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:12:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-08 17:12:27,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 318. [2024-11-08 17:12:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 288 states have (on average 1.5173611111111112) internal successors, (437), 288 states have internal predecessors, (437), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:12:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 493 transitions. [2024-11-08 17:12:27,845 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 493 transitions. Word has length 189 [2024-11-08 17:12:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:27,848 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 493 transitions. [2024-11-08 17:12:27,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:27,849 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 493 transitions. [2024-11-08 17:12:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 17:12:27,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:27,857 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:27,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:12:27,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:27,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:27,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1559266381, now seen corresponding path program 1 times [2024-11-08 17:12:27,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:27,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792263027] [2024-11-08 17:12:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:27,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:12:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:12:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:12:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:12:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:12:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:12:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:12:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:12:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:12:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:12:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:12:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:12:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:12:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:12:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:12:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:12:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:12:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:12:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:12:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:12:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 17:12:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 17:12:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 17:12:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:12:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 17:12:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 17:12:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 17:12:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 17:12:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 17:12:28,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:28,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792263027] [2024-11-08 17:12:28,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792263027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:28,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:28,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:12:28,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386121366] [2024-11-08 17:12:28,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:28,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:12:28,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:28,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:12:28,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:12:28,259 INFO L87 Difference]: Start difference. First operand 318 states and 493 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:28,417 INFO L93 Difference]: Finished difference Result 822 states and 1279 transitions. [2024-11-08 17:12:28,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:12:28,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-08 17:12:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:28,426 INFO L225 Difference]: With dead ends: 822 [2024-11-08 17:12:28,426 INFO L226 Difference]: Without dead ends: 507 [2024-11-08 17:12:28,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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:12:28,429 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 144 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:28,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 455 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:12:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-08 17:12:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 318. [2024-11-08 17:12:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 288 states have (on average 1.5173611111111112) internal successors, (437), 288 states have internal predecessors, (437), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:12:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 493 transitions. [2024-11-08 17:12:28,467 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 493 transitions. Word has length 189 [2024-11-08 17:12:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:28,468 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 493 transitions. [2024-11-08 17:12:28,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 493 transitions. [2024-11-08 17:12:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 17:12:28,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:28,474 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:28,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:12:28,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:28,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash 363961653, now seen corresponding path program 1 times [2024-11-08 17:12:28,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:28,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024398089] [2024-11-08 17:12:28,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:28,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:12:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:12:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:12:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:12:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:12:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:12:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:12:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:12:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:12:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:12:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:12:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:12:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:12:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:12:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:12:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:12:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:12:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:12:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:12:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:12:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 17:12:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 17:12:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 17:12:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:12:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 17:12:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 17:12:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 17:12:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 17:12:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 17:12:28,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:28,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024398089] [2024-11-08 17:12:28,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024398089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:28,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:28,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:12:28,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747504141] [2024-11-08 17:12:28,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:28,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:12:28,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:28,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:12:28,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:12:28,981 INFO L87 Difference]: Start difference. First operand 318 states and 493 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:29,259 INFO L93 Difference]: Finished difference Result 701 states and 1088 transitions. [2024-11-08 17:12:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:12:29,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-08 17:12:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:29,263 INFO L225 Difference]: With dead ends: 701 [2024-11-08 17:12:29,264 INFO L226 Difference]: Without dead ends: 386 [2024-11-08 17:12:29,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:12:29,266 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 46 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:29,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 296 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:12:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-08 17:12:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 324. [2024-11-08 17:12:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 294 states have (on average 1.5136054421768708) internal successors, (445), 294 states have internal predecessors, (445), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:12:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 501 transitions. [2024-11-08 17:12:29,289 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 501 transitions. Word has length 189 [2024-11-08 17:12:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:29,290 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 501 transitions. [2024-11-08 17:12:29,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 501 transitions. [2024-11-08 17:12:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 17:12:29,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:29,295 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:29,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:12:29,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:29,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:29,296 INFO L85 PathProgramCache]: Analyzing trace with hash -260202447, now seen corresponding path program 1 times [2024-11-08 17:12:29,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468522703] [2024-11-08 17:12:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:12:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:12:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:12:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:12:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:12:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:12:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:12:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:12:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:12:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:12:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:12:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:12:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:12:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:12:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:12:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:12:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:12:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:12:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:12:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:12:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 17:12:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 17:12:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 17:12:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:12:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 17:12:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 17:12:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 17:12:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 17:12:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 17:12:29,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:12:29,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468522703] [2024-11-08 17:12:29,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468522703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:29,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:29,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:12:29,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93412920] [2024-11-08 17:12:29,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:29,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:12:29,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:12:29,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:12:29,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:12:29,819 INFO L87 Difference]: Start difference. First operand 324 states and 501 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:30,593 INFO L93 Difference]: Finished difference Result 964 states and 1474 transitions. [2024-11-08 17:12:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:12:30,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-08 17:12:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:30,599 INFO L225 Difference]: With dead ends: 964 [2024-11-08 17:12:30,599 INFO L226 Difference]: Without dead ends: 643 [2024-11-08 17:12:30,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:12:30,602 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 273 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:30,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 667 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:12:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-08 17:12:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 457. [2024-11-08 17:12:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 427 states have (on average 1.515222482435597) internal successors, (647), 427 states have internal predecessors, (647), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:12:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 703 transitions. [2024-11-08 17:12:30,642 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 703 transitions. Word has length 190 [2024-11-08 17:12:30,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:30,643 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 703 transitions. [2024-11-08 17:12:30,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:12:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 703 transitions. [2024-11-08 17:12:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 17:12:30,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:30,648 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:30,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:12:30,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:30,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash -502280485, now seen corresponding path program 1 times [2024-11-08 17:12:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:12:30,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236455821] [2024-11-08 17:12:30,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:12:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:12:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111713128] [2024-11-08 17:12:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:30,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:12:30,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:12:30,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:12:30,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:12:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:12:31,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:12:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:12:31,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:12:31,459 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:12:31,460 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:12:31,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:12:31,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:12:31,666 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:31,838 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:12:31,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:12:31 BoogieIcfgContainer [2024-11-08 17:12:31,845 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:12:31,850 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:12:31,850 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:12:31,850 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:12:31,851 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:23" (3/4) ... [2024-11-08 17:12:31,854 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:12:31,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:12:31,856 INFO L158 Benchmark]: Toolchain (without parser) took 9807.18ms. Allocated memory was 130.0MB in the beginning and 255.9MB in the end (delta: 125.8MB). Free memory was 71.1MB in the beginning and 141.1MB in the end (delta: -70.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-08 17:12:31,857 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 130.0MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:12:31,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.09ms. Allocated memory was 130.0MB in the beginning and 176.2MB in the end (delta: 46.1MB). Free memory was 70.9MB in the beginning and 136.6MB in the end (delta: -65.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-08 17:12:31,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.13ms. Allocated memory is still 176.2MB. Free memory was 136.6MB in the beginning and 132.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:12:31,858 INFO L158 Benchmark]: Boogie Preprocessor took 82.59ms. Allocated memory is still 176.2MB. Free memory was 132.4MB in the beginning and 126.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 17:12:31,859 INFO L158 Benchmark]: RCFGBuilder took 1130.24ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 93.9MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-08 17:12:31,859 INFO L158 Benchmark]: TraceAbstraction took 7852.04ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 93.9MB in the beginning and 141.1MB in the end (delta: -47.3MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-11-08 17:12:31,860 INFO L158 Benchmark]: Witness Printer took 6.02ms. Allocated memory is still 255.9MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:12:31,862 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.37ms. Allocated memory is still 130.0MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.09ms. Allocated memory was 130.0MB in the beginning and 176.2MB in the end (delta: 46.1MB). Free memory was 70.9MB in the beginning and 136.6MB in the end (delta: -65.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.13ms. Allocated memory is still 176.2MB. Free memory was 136.6MB in the beginning and 132.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.59ms. Allocated memory is still 176.2MB. Free memory was 132.4MB in the beginning and 126.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1130.24ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 93.9MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7852.04ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 93.9MB in the beginning and 141.1MB in the end (delta: -47.3MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Witness Printer took 6.02ms. Allocated memory is still 255.9MB. Free memory is still 141.1MB. 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 193, overapproximation of someBinaryFLOATComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] unsigned char var_1_3 = 32; [L24] unsigned char var_1_4 = 4; [L25] double var_1_5 = 128.5; [L26] signed long int var_1_6 = 64; [L27] signed long int var_1_7 = 4; [L28] double var_1_8 = 1.875; [L29] double var_1_9 = 0.1; [L30] double var_1_10 = 32.6; [L31] double var_1_11 = 0.6; [L32] signed long int var_1_12 = -128; [L33] signed long int var_1_14 = 16; [L34] signed short int var_1_15 = 1; [L35] signed long int var_1_18 = 2; [L36] signed char var_1_19 = 32; [L37] signed char var_1_20 = 50; [L38] signed short int var_1_21 = 16; [L39] unsigned char var_1_22 = 0; [L40] signed long int var_1_23 = 25; [L41] unsigned short int var_1_24 = 50906; [L42] unsigned short int var_1_25 = 21992; [L43] float var_1_26 = 3.25; [L44] float var_1_27 = 10.2; [L45] float var_1_28 = 16.5; [L46] float var_1_29 = 0.0; [L47] float var_1_30 = 99.8; [L48] signed char var_1_31 = 2; [L49] float var_1_33 = 4.2; [L50] unsigned char last_1_var_1_1 = 32; [L51] unsigned char last_1_var_1_22 = 0; [L52] signed long int last_1_var_1_23 = 25; VAL [isInitial=0, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_22 = var_1_22 [L190] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L142] var_1_3 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L143] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L144] CALL assume_abort_if_not(var_1_3 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L144] RET assume_abort_if_not(var_1_3 <= 64) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L145] var_1_4 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L146] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L147] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L147] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L148] var_1_6 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L149] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L150] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L150] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L151] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L151] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L152] var_1_7 = __VERIFIER_nondet_long() [L153] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L153] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L154] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L154] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L155] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L155] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L156] var_1_8 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_9=1/10] [L157] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_9=1/10] [L158] var_1_9 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L159] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L160] var_1_10 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L161] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L162] var_1_11 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L163] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L164] var_1_18 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_18 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L165] RET assume_abort_if_not(var_1_18 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L166] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L166] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L167] CALL assume_abort_if_not(var_1_18 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L167] RET assume_abort_if_not(var_1_18 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L168] var_1_20 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L169] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L170] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L170] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L171] var_1_24 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L172] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L173] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L173] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L174] var_1_25 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_25 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L175] RET assume_abort_if_not(var_1_25 >= 16383) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L176] CALL assume_abort_if_not(var_1_25 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L176] RET assume_abort_if_not(var_1_25 <= 32767) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L177] var_1_27 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L178] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L179] var_1_28 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L180] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L181] var_1_29 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L182] RET assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L183] var_1_31 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L184] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L185] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L185] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L201] RET updateVariables() [L202] CALL step() [L56] COND FALSE !(last_1_var_1_22 || last_1_var_1_22) [L63] var_1_15 = 2 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L65] var_1_22 = 0 [L66] var_1_33 = var_1_10 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L67] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L70] unsigned char stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_1=0, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L71] COND TRUE stepLocal_1 || (var_1_4 <= (- var_1_6)) [L72] var_1_14 = ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L76] signed long int stepLocal_0 = (var_1_3 / 1) / var_1_6; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L77] COND FALSE !(\read(var_1_22)) [L84] var_1_5 = var_1_10 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L86] signed long int stepLocal_4 = (((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)); VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_4=3, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L87] COND FALSE !((var_1_24 - (var_1_25 - var_1_3)) <= stepLocal_4) [L94] var_1_23 = var_1_1 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L96] var_1_12 = ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100)))) [L97] signed long int stepLocal_7 = -1; [L98] signed long int stepLocal_6 = 0 & var_1_25; [L99] signed short int stepLocal_5 = var_1_15; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_5=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L100] COND FALSE !(stepLocal_5 < var_1_15) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L109] COND TRUE var_1_9 > (var_1_26 * var_1_8) [L110] var_1_19 = var_1_4 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L114] signed short int stepLocal_3 = var_1_15; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L115] EXPR 5 | var_1_3 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L115] EXPR var_1_4 << var_1_18 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L115] unsigned char stepLocal_2 = (5 | var_1_3) < (var_1_4 << var_1_18); [L116] COND FALSE !(stepLocal_2 && (var_1_19 < var_1_23)) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L119] COND TRUE var_1_18 > stepLocal_3 [L120] var_1_21 = var_1_20 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L125] EXPR var_1_15 ^ var_1_21 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L125] COND FALSE !((var_1_15 ^ var_1_21) <= var_1_21) [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR ((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4)))) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L193] EXPR ((((((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4))))) && (var_1_22 == ((unsigned char) 0))) && (((var_1_24 - (var_1_25 - var_1_3)) <= ((((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)))) ? (var_1_22 ? (var_1_23 == ((signed long int) (var_1_24 - var_1_25))) : (var_1_23 == ((signed long int) 50))) : (var_1_23 == ((signed long int) var_1_1)))) && ((var_1_15 < var_1_15) ? ((-1 >= var_1_23) ? ((var_1_23 <= (0 & var_1_25)) ? (var_1_26 == ((float) (var_1_9 - (var_1_27 + var_1_28)))) : 1) : (var_1_26 == ((float) (((((var_1_9) > ((var_1_29 - var_1_28))) ? (var_1_9) : ((var_1_29 - var_1_28)))) - var_1_27)))) : 1)) && (((var_1_15 ^ var_1_21) <= var_1_21) ? ((var_1_22 && var_1_22) ? (var_1_22 ? (var_1_30 == ((float) ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))))) : 1) : ((((var_1_3 + var_1_4) - var_1_31) <= var_1_21) ? ((var_1_20 < var_1_1) ? (var_1_30 == ((float) (var_1_9 - var_1_27))) : (var_1_30 == ((float) ((((var_1_10) > (var_1_8)) ? (var_1_10) : (var_1_8)))))) : 1)) : 1) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L193-L194] return (((((((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4))))) && (var_1_22 == ((unsigned char) 0))) && (((var_1_24 - (var_1_25 - var_1_3)) <= ((((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)))) ? (var_1_22 ? (var_1_23 == ((signed long int) (var_1_24 - var_1_25))) : (var_1_23 == ((signed long int) 50))) : (var_1_23 == ((signed long int) var_1_1)))) && ((var_1_15 < var_1_15) ? ((-1 >= var_1_23) ? ((var_1_23 <= (0 & var_1_25)) ? (var_1_26 == ((float) (var_1_9 - (var_1_27 + var_1_28)))) : 1) : (var_1_26 == ((float) (((((var_1_9) > ((var_1_29 - var_1_28))) ? (var_1_9) : ((var_1_29 - var_1_28)))) - var_1_27)))) : 1)) && (((var_1_15 ^ var_1_21) <= var_1_21) ? ((var_1_22 && var_1_22) ? (var_1_22 ? (var_1_30 == ((float) ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))))) : 1) : ((((var_1_3 + var_1_4) - var_1_31) <= var_1_21) ? ((var_1_20 < var_1_1) ? (var_1_30 == ((float) (var_1_9 - var_1_27))) : (var_1_30 == ((float) ((((var_1_10) > (var_1_8)) ? (var_1_10) : (var_1_8)))))) : 1)) : 1)) && (var_1_33 == ((float) var_1_10)) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 893 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 893 mSDsluCounter, 2732 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1201 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 625 IncrementalHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1531 mSDtfsCounter, 625 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=7, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 608 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1701 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1314 ConstructedInterpolants, 0 QuantifiedInterpolants, 1614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10584/10584 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:12:31,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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_2c647db2-6cc6-4b63-b868-67031fbaeb34/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 ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:12:35,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:12:35,131 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:12:35,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:12:35,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:12:35,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:12:35,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:12:35,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:12:35,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:12:35,209 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:12:35,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:12:35,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:12:35,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:12:35,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:12:35,215 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:12:35,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:12:35,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:12:35,217 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:12:35,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:12:35,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:12:35,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:12:35,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:12:35,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:12:35,224 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:12:35,224 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:12:35,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:12:35,225 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:12:35,226 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:12:35,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:12:35,230 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:12:35,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:12:35,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:12:35,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:12:35,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:12:35,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:12:35,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:12:35,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:12:35,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:12:35,237 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:12:35,238 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:12:35,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:12:35,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:12:35,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:12:35,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:12:35,241 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_2c647db2-6cc6-4b63-b868-67031fbaeb34/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_2c647db2-6cc6-4b63-b868-67031fbaeb34/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 -> ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb [2024-11-08 17:12:35,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:12:35,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:12:35,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:12:35,838 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:12:35,839 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:12:35,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i Unable to find full path for "g++" [2024-11-08 17:12:38,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:12:38,766 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:12:38,767 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i [2024-11-08 17:12:38,787 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/data/ca2386967/21ac62fb5c3248238c27acc3c5f12b41/FLAG37a173ebc [2024-11-08 17:12:38,815 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/data/ca2386967/21ac62fb5c3248238c27acc3c5f12b41 [2024-11-08 17:12:38,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:12:38,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:12:38,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:12:38,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:12:38,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:12:38,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:38" (1/1) ... [2024-11-08 17:12:38,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e886085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:38, skipping insertion in model container [2024-11-08 17:12:38,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:12:38" (1/1) ... [2024-11-08 17:12:38,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:12:39,195 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_2c647db2-6cc6-4b63-b868-67031fbaeb34/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i[916,929] [2024-11-08 17:12:39,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:12:39,363 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:12:39,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i[916,929] [2024-11-08 17:12:39,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:12:39,479 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:12:39,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39 WrapperNode [2024-11-08 17:12:39,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:12:39,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:12:39,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:12:39,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:12:39,491 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:12:39" (1/1) ... [2024-11-08 17:12:39,516 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:12:39" (1/1) ... [2024-11-08 17:12:39,583 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2024-11-08 17:12:39,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:12:39,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:12:39,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:12:39,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:12:39,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39" (1/1) ... [2024-11-08 17:12:39,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39" (1/1) ... [2024-11-08 17:12:39,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39" (1/1) ... [2024-11-08 17:12:39,680 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:12:39,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39" (1/1) ... [2024-11-08 17:12:39,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39" (1/1) ... [2024-11-08 17:12:39,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39" (1/1) ... [2024-11-08 17:12:39,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39" (1/1) ... [2024-11-08 17:12:39,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39" (1/1) ... [2024-11-08 17:12:39,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39" (1/1) ... [2024-11-08 17:12:39,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:12:39,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:12:39,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:12:39,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:12:39,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39" (1/1) ... [2024-11-08 17:12:39,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:12:39,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:12:39,804 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:12:39,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:12:39,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:12:39,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:12:39,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:12:39,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:12:39,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:12:39,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:12:40,008 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:12:40,011 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:12:58,493 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 17:12:58,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:12:58,515 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:12:58,515 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:12:58,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:58 BoogieIcfgContainer [2024-11-08 17:12:58,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:12:58,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:12:58,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:12:58,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:12:58,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:12:38" (1/3) ... [2024-11-08 17:12:58,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfb0c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:58, skipping insertion in model container [2024-11-08 17:12:58,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:12:39" (2/3) ... [2024-11-08 17:12:58,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfb0c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:12:58, skipping insertion in model container [2024-11-08 17:12:58,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:12:58" (3/3) ... [2024-11-08 17:12:58,530 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-15.i [2024-11-08 17:12:58,549 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:12:58,550 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:12:58,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:12:58,641 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;@6ab6b49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:12:58,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:12:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:12:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 17:12:58,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:58,671 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:58,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:12:58,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash -576489405, now seen corresponding path program 1 times [2024-11-08 17:12:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:12:58,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686671499] [2024-11-08 17:12:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:58,704 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:12:58,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:12:58,727 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:12:58,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:12:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:59,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:12:59,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:12:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 702 proven. 0 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-11-08 17:12:59,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:12:59,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:12:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686671499] [2024-11-08 17:12:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686671499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:12:59,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:12:59,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:12:59,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744284027] [2024-11-08 17:12:59,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:12:59,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:12:59,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:13:00,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:13:00,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:13:00,035 INFO L87 Difference]: Start difference. First operand has 88 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 17:13:00,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:00,087 INFO L93 Difference]: Finished difference Result 169 states and 296 transitions. [2024-11-08 17:13:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:13:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2024-11-08 17:13:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:00,103 INFO L225 Difference]: With dead ends: 169 [2024-11-08 17:13:00,103 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 17:13:00,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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:13:00,114 INFO L432 NwaCegarLoop]: 130 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, 130 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:13:00,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:13:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 17:13:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-08 17:13:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:13:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2024-11-08 17:13:00,189 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 180 [2024-11-08 17:13:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:00,191 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2024-11-08 17:13:00,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 17:13:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2024-11-08 17:13:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 17:13:00,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:00,204 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:00,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 17:13:00,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:13:00,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:00,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash -222120501, now seen corresponding path program 1 times [2024-11-08 17:13:00,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:13:00,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119914585] [2024-11-08 17:13:00,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:00,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:13:00,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:13:00,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:13:00,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:13:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:01,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:13:01,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:13:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 17:13:01,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:13:01,726 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:13:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119914585] [2024-11-08 17:13:01,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119914585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:13:01,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:13:01,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:13:01,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182121491] [2024-11-08 17:13:01,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:13:01,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:13:01,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:13:01,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:13:01,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:13:01,732 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:13:06,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:13:10,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:13:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:13:10,955 INFO L93 Difference]: Finished difference Result 241 states and 374 transitions. [2024-11-08 17:13:10,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:13:10,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-11-08 17:13:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:13:10,966 INFO L225 Difference]: With dead ends: 241 [2024-11-08 17:13:10,967 INFO L226 Difference]: Without dead ends: 160 [2024-11-08 17:13:10,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 178 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:13:10,970 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 111 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:13:10,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 344 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2024-11-08 17:13:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-08 17:13:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 101. [2024-11-08 17:13:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:13:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2024-11-08 17:13:11,000 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 180 [2024-11-08 17:13:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:13:11,003 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2024-11-08 17:13:11,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 17:13:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2024-11-08 17:13:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 17:13:11,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:13:11,008 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:11,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 17:13:11,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:13:11,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:13:11,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:13:11,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1810468403, now seen corresponding path program 1 times [2024-11-08 17:13:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:13:11,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199590067] [2024-11-08 17:13:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:11,212 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:13:11,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:13:11,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:13:11,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c647db2-6cc6-4b63-b868-67031fbaeb34/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:13:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:12,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 17:13:12,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:15:10,881 WARN L286 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:15:19,591 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:15:27,769 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:15:35,935 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:15:43,596 WARN L286 SmtUtils]: Spent 7.66s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:15:49,739 WARN L286 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:04,094 WARN L286 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:14,849 WARN L286 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:23,041 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:29,725 WARN L286 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:41,586 WARN L286 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:53,764 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:01,916 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:07,313 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:23,091 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:35,164 WARN L286 SmtUtils]: Spent 7.60s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:47,077 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:58,256 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:03,290 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:09,703 WARN L286 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:17,852 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:25,836 WARN L286 SmtUtils]: Spent 7.98s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:38,054 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:52,409 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) c_~var_1_3~0)) (.cse2 ((_ sign_extend 16) (_ bv2 16))) (.cse3 ((_ zero_extend 16) c_~var_1_24~0)) (.cse9 ((_ zero_extend 24) c_~var_1_1~0)) (.cse8 ((_ zero_extend 24) c_~var_1_4~0)) (.cse5 ((_ zero_extend 16) c_~var_1_25~0))) (and (let ((.cse1 (bvadd .cse3 (bvneg (bvadd (bvneg .cse4) .cse5)))) (.cse0 (bvsgt .cse2 c_~var_1_7~0))) (or (and (not .cse0) (not (bvsle .cse1 c_~var_1_7~0))) (and (not (bvsle .cse1 .cse2)) .cse0))) (bvsle .cse5 (_ bv32767 32)) (= (_ bv0 8) c_~var_1_22~0) (fp.gt c_~var_1_9~0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_26~0) c_~var_1_8~0)) (let ((.cse7 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse6))) (fp.leq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse7)))) (and (fp.geq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode .cse7)) (fp.leq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode .cse6))))) (= (_ bv0 8) c_~last_1_var_1_22~0) (= c_~var_1_4~0 c_~var_1_19~0) (let ((.cse10 (bvslt .cse9 (_ bv100 32)))) (let ((.cse11 (not .cse10)) (.cse12 (bvslt c_~var_1_23~0 .cse4))) (or (and (or (and (= (bvadd .cse8 .cse9 c_~var_1_23~0) c_~var_1_12~0) .cse10) (and .cse11 (= (bvadd .cse8 (_ bv100 32) c_~var_1_23~0) c_~var_1_12~0))) .cse12) (and (or (and .cse10 (= (bvadd .cse8 .cse4 .cse9) c_~var_1_12~0)) (and .cse11 (= (bvadd .cse8 (_ bv100 32) .cse4) c_~var_1_12~0))) (not .cse12))))) (let ((.cse14 (= .cse2 c_~var_1_14~0)) (.cse13 (bvsgt .cse4 .cse8))) (or (and (not .cse13) (let ((.cse15 (bvsgt .cse8 .cse2))) (or (and .cse14 (not .cse15)) (and .cse15 (= .cse8 c_~var_1_14~0))))) (and (let ((.cse16 (bvsgt .cse4 .cse2))) (or (and .cse14 (not .cse16)) (and .cse16 (= .cse4 c_~var_1_14~0)))) .cse13))) (bvsge .cse3 (_ bv32767 32)) (= .cse9 c_~var_1_23~0) (= c_~var_1_5~0 c_~var_1_10~0) (bvsle .cse8 (bvneg c_~var_1_6~0)) (= (_ bv2 16) c_~var_1_15~0) (= c_~var_1_33~0 ((_ to_fp 8 24) c_currentRoundingMode c_~var_1_10~0)) (bvsge .cse5 (_ bv16383 32)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-08 17:19:00,831 WARN L286 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:19:11,540 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:19:19,681 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:19:27,775 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:19:38,616 WARN L286 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:19:49,391 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:19:54,788 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:20:06,300 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:20:21,693 WARN L286 SmtUtils]: Spent 7.78s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:20:29,712 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:20:37,767 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:20:52,583 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:21:03,971 WARN L286 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:21:12,631 WARN L286 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:21:20,172 WARN L286 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:21:27,515 WARN L286 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:21:37,589 WARN L286 SmtUtils]: Spent 7.92s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:21:45,733 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:21:51,463 WARN L286 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:21:57,351 WARN L286 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:22:09,252 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:22:17,396 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:22:25,538 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:22:32,755 WARN L286 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:22:40,911 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:22:52,620 WARN L286 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:25:40,860 WARN L286 SmtUtils]: Spent 1.02m on a formula simplification that was a NOOP. DAG size: 133 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:25:46,959 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:25:52,645 WARN L286 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:26:10,716 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:26:16,111 WARN L286 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:26:29,530 WARN L286 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:26:44,220 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:26:50,498 WARN L286 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)