./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU --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 fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:26,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:26,883 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:57:26,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:26,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:26,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:26,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:26,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:26,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:26,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:26,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:26,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:26,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:26,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:26,942 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:26,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:26,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:57:26,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:26,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:57:26,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:26,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:26,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:57:26,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:26,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:57:26,949 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:26,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:26,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:57:26,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:26,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:26,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:26,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:26,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:26,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:26,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:26,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:26,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:57:26,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:57:26,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:57:26,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:26,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:26,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:26,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:26,957 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_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/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_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU 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 -> fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb [2024-10-31 21:57:27,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:27,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:27,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:27,265 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:27,266 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:27,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i Unable to find full path for "g++" [2024-10-31 21:57:29,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:29,714 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:29,716 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-10-31 21:57:29,731 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/data/7af54ecd5/f228c86294394785a09707d1ef6668f8/FLAGfb497b255 [2024-10-31 21:57:30,036 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/data/7af54ecd5/f228c86294394785a09707d1ef6668f8 [2024-10-31 21:57:30,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:30,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:30,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:30,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:30,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:30,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f35524a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30, skipping insertion in model container [2024-10-31 21:57:30,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:30,272 WARN L251 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_b309c43c-335a-4f12-a985-023931748970/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2024-10-31 21:57:30,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:30,376 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:30,388 WARN L251 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_b309c43c-335a-4f12-a985-023931748970/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2024-10-31 21:57:30,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:30,482 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:30,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30 WrapperNode [2024-10-31 21:57:30,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:30,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:30,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:30,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:30,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,575 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2024-10-31 21:57:30,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:30,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:30,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:30,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:30,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,653 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-10-31 21:57:30,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:30,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:30,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:30,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:30,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (1/1) ... [2024-10-31 21:57:30,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:30,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:30,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:30,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:57:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:57:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:57:30,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:30,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:30,961 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:30,965 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:57:31,643 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-31 21:57:31,643 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:57:31,664 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:57:31,665 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:57:31,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:31 BoogieIcfgContainer [2024-10-31 21:57:31,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:57:31,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:57:31,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:57:31,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:57:31,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:30" (1/3) ... [2024-10-31 21:57:31,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b8295c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:31, skipping insertion in model container [2024-10-31 21:57:31,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:30" (2/3) ... [2024-10-31 21:57:31,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b8295c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:31, skipping insertion in model container [2024-10-31 21:57:31,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:31" (3/3) ... [2024-10-31 21:57:31,679 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-10-31 21:57:31,705 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:57:31,705 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:57:31,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:57:31,787 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;@68a4fd1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:57:31,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:57:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 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-10-31 21:57:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-31 21:57:31,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:31,811 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] [2024-10-31 21:57:31,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:31,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:31,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1127324023, now seen corresponding path program 1 times [2024-10-31 21:57:31,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:31,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384969559] [2024-10-31 21:57:31,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:57:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:57:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:57:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:57:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:57:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-31 21:57:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-31 21:57:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:57:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:57:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:57:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:57:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:57:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 21:57:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384969559] [2024-10-31 21:57:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384969559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:32,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:32,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:32,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970402915] [2024-10-31 21:57:32,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:32,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:57:32,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:32,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:57:32,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:32,574 INFO L87 Difference]: Start difference. First operand has 106 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 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) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-10-31 21:57:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:32,620 INFO L93 Difference]: Finished difference Result 205 states and 360 transitions. [2024-10-31 21:57:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:57:32,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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 181 [2024-10-31 21:57:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:32,630 INFO L225 Difference]: With dead ends: 205 [2024-10-31 21:57:32,631 INFO L226 Difference]: Without dead ends: 102 [2024-10-31 21:57:32,637 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-10-31 21:57:32,643 INFO L432 NwaCegarLoop]: 161 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, 161 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-10-31 21:57:32,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-31 21:57:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-31 21:57:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 72 states have internal predecessors, (105), 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-10-31 21:57:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 161 transitions. [2024-10-31 21:57:32,714 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 161 transitions. Word has length 181 [2024-10-31 21:57:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:32,718 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 161 transitions. [2024-10-31 21:57:32,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-10-31 21:57:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 161 transitions. [2024-10-31 21:57:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-31 21:57:32,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:32,727 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] [2024-10-31 21:57:32,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:57:32,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:32,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:32,730 INFO L85 PathProgramCache]: Analyzing trace with hash -145092915, now seen corresponding path program 1 times [2024-10-31 21:57:32,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:32,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794661220] [2024-10-31 21:57:32,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:32,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:57:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:57:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:57:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:57:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:57:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-31 21:57:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-31 21:57:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:57:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:57:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:57:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:57:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:57:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 21:57:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794661220] [2024-10-31 21:57:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794661220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:33,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:57:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581483432] [2024-10-31 21:57:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:33,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:57:33,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:33,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:57:33,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:57:33,518 INFO L87 Difference]: Start difference. First operand 102 states and 161 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-10-31 21:57:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:33,637 INFO L93 Difference]: Finished difference Result 300 states and 477 transitions. [2024-10-31 21:57:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:57:33,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 181 [2024-10-31 21:57:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:33,642 INFO L225 Difference]: With dead ends: 300 [2024-10-31 21:57:33,642 INFO L226 Difference]: Without dead ends: 201 [2024-10-31 21:57:33,643 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-10-31 21:57:33,644 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 96 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:33,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 316 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-31 21:57:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2024-10-31 21:57:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 140 states have internal predecessors, (202), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-31 21:57:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 314 transitions. [2024-10-31 21:57:33,693 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 314 transitions. Word has length 181 [2024-10-31 21:57:33,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:33,694 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 314 transitions. [2024-10-31 21:57:33,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-10-31 21:57:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 314 transitions. [2024-10-31 21:57:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-31 21:57:33,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:33,698 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] [2024-10-31 21:57:33,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:57:33,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:33,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash -868007988, now seen corresponding path program 1 times [2024-10-31 21:57:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:33,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315573975] [2024-10-31 21:57:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:33,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:57:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:57:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:57:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:57:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:57:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-31 21:57:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-31 21:57:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:57:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:57:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:57:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:57:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:57:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 21:57:34,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:34,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315573975] [2024-10-31 21:57:34,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315573975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:34,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:34,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:57:34,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532556766] [2024-10-31 21:57:34,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:34,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:57:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:34,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:57:34,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:57:34,010 INFO L87 Difference]: Start difference. First operand 199 states and 314 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-10-31 21:57:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:34,131 INFO L93 Difference]: Finished difference Result 459 states and 720 transitions. [2024-10-31 21:57:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:57:34,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 182 [2024-10-31 21:57:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:34,141 INFO L225 Difference]: With dead ends: 459 [2024-10-31 21:57:34,141 INFO L226 Difference]: Without dead ends: 263 [2024-10-31 21:57:34,143 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-10-31 21:57:34,147 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 43 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:34,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-31 21:57:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 217. [2024-10-31 21:57:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 158 states have (on average 1.4430379746835442) internal successors, (228), 158 states have internal predecessors, (228), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-31 21:57:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 340 transitions. [2024-10-31 21:57:34,190 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 340 transitions. Word has length 182 [2024-10-31 21:57:34,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:34,191 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 340 transitions. [2024-10-31 21:57:34,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-10-31 21:57:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 340 transitions. [2024-10-31 21:57:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-31 21:57:34,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:34,195 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] [2024-10-31 21:57:34,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:57:34,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:34,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:34,196 INFO L85 PathProgramCache]: Analyzing trace with hash 167271026, now seen corresponding path program 1 times [2024-10-31 21:57:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:34,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183956137] [2024-10-31 21:57:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:57:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:57:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:57:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:57:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:57:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-31 21:57:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-31 21:57:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:57:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:57:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:57:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:57:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:57:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 21:57:34,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:34,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183956137] [2024-10-31 21:57:34,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183956137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:34,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:34,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:57:34,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055804969] [2024-10-31 21:57:34,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:34,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:57:34,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:34,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:57:34,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:57:34,474 INFO L87 Difference]: Start difference. First operand 217 states and 340 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-10-31 21:57:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:34,676 INFO L93 Difference]: Finished difference Result 637 states and 1004 transitions. [2024-10-31 21:57:34,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:57:34,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 182 [2024-10-31 21:57:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:34,683 INFO L225 Difference]: With dead ends: 637 [2024-10-31 21:57:34,683 INFO L226 Difference]: Without dead ends: 423 [2024-10-31 21:57:34,684 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-10-31 21:57:34,685 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 145 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:34,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 434 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-31 21:57:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2024-10-31 21:57:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 304 states have (on average 1.4342105263157894) internal successors, (436), 304 states have internal predecessors, (436), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-31 21:57:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 660 transitions. [2024-10-31 21:57:34,759 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 660 transitions. Word has length 182 [2024-10-31 21:57:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:34,760 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 660 transitions. [2024-10-31 21:57:34,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-10-31 21:57:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 660 transitions. [2024-10-31 21:57:34,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-31 21:57:34,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:34,765 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] [2024-10-31 21:57:34,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:57:34,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:34,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:34,766 INFO L85 PathProgramCache]: Analyzing trace with hash -449435971, now seen corresponding path program 1 times [2024-10-31 21:57:34,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:34,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549520558] [2024-10-31 21:57:34,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:34,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:57:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:57:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:57:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:57:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:57:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-31 21:57:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-31 21:57:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:57:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:57:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:57:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:57:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:57:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 21:57:35,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:35,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549520558] [2024-10-31 21:57:35,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549520558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:35,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:35,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:57:35,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525708539] [2024-10-31 21:57:35,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:35,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:35,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:35,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:35,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:35,418 INFO L87 Difference]: Start difference. First operand 421 states and 660 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-10-31 21:57:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:35,836 INFO L93 Difference]: Finished difference Result 1053 states and 1654 transitions. [2024-10-31 21:57:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:35,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 183 [2024-10-31 21:57:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:35,843 INFO L225 Difference]: With dead ends: 1053 [2024-10-31 21:57:35,843 INFO L226 Difference]: Without dead ends: 843 [2024-10-31 21:57:35,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:57:35,846 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 174 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:35,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 517 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:57:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-10-31 21:57:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 835. [2024-10-31 21:57:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 602 states have (on average 1.4385382059800664) internal successors, (866), 602 states have internal predecessors, (866), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-10-31 21:57:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1314 transitions. [2024-10-31 21:57:35,926 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1314 transitions. Word has length 183 [2024-10-31 21:57:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:35,930 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1314 transitions. [2024-10-31 21:57:35,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-10-31 21:57:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1314 transitions. [2024-10-31 21:57:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-31 21:57:35,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:35,933 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] [2024-10-31 21:57:35,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:57:35,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:35,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1549882769, now seen corresponding path program 1 times [2024-10-31 21:57:35,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:35,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554002849] [2024-10-31 21:57:35,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:35,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:57:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:57:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:57:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:57:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:57:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-31 21:57:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-31 21:57:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:57:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:57:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:57:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:57:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:57:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-31 21:57:37,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:37,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554002849] [2024-10-31 21:57:37,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554002849] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:57:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498802916] [2024-10-31 21:57:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:37,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:37,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:37,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:57:37,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 21:57:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-31 21:57:37,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:57:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 950 proven. 138 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-31 21:57:39,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:57:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 87 proven. 147 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2024-10-31 21:57:41,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498802916] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:57:41,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:57:41,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 25 [2024-10-31 21:57:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726813229] [2024-10-31 21:57:41,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:57:41,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-31 21:57:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:41,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-31 21:57:41,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2024-10-31 21:57:41,354 INFO L87 Difference]: Start difference. First operand 835 states and 1314 transitions. Second operand has 25 states, 25 states have (on average 5.0) internal successors, (125), 25 states have internal predecessors, (125), 8 states have call successors, (70), 4 states have call predecessors, (70), 10 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) [2024-10-31 21:57:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:43,518 INFO L93 Difference]: Finished difference Result 1555 states and 2364 transitions. [2024-10-31 21:57:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-31 21:57:43,519 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.0) internal successors, (125), 25 states have internal predecessors, (125), 8 states have call successors, (70), 4 states have call predecessors, (70), 10 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) Word has length 183 [2024-10-31 21:57:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:43,526 INFO L225 Difference]: With dead ends: 1555 [2024-10-31 21:57:43,526 INFO L226 Difference]: Without dead ends: 723 [2024-10-31 21:57:43,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=655, Invalid=1601, Unknown=0, NotChecked=0, Total=2256 [2024-10-31 21:57:43,532 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 873 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:43,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 473 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 21:57:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-10-31 21:57:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 693. [2024-10-31 21:57:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 532 states have (on average 1.3834586466165413) internal successors, (736), 536 states have internal predecessors, (736), 136 states have call successors, (136), 24 states have call predecessors, (136), 24 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-31 21:57:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1008 transitions. [2024-10-31 21:57:43,656 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1008 transitions. Word has length 183 [2024-10-31 21:57:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:43,656 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1008 transitions. [2024-10-31 21:57:43,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.0) internal successors, (125), 25 states have internal predecessors, (125), 8 states have call successors, (70), 4 states have call predecessors, (70), 10 states have return successors, (72), 8 states have call predecessors, (72), 8 states have call successors, (72) [2024-10-31 21:57:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1008 transitions. [2024-10-31 21:57:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-31 21:57:43,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:43,660 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] [2024-10-31 21:57:43,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 21:57:43,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:43,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:43,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:43,862 INFO L85 PathProgramCache]: Analyzing trace with hash -872701152, now seen corresponding path program 1 times [2024-10-31 21:57:43,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:43,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669475213] [2024-10-31 21:57:43,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:43,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:57:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:57:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:57:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:57:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:57:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-31 21:57:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-31 21:57:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:57:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:57:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:57:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:57:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:57:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 21:57:44,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669475213] [2024-10-31 21:57:44,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669475213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:44,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:44,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:57:44,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464253385] [2024-10-31 21:57:44,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:44,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:57:44,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:44,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:57:44,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:44,360 INFO L87 Difference]: Start difference. First operand 693 states and 1008 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-31 21:57:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:45,452 INFO L93 Difference]: Finished difference Result 2099 states and 3046 transitions. [2024-10-31 21:57:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:57:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 184 [2024-10-31 21:57:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:45,468 INFO L225 Difference]: With dead ends: 2099 [2024-10-31 21:57:45,468 INFO L226 Difference]: Without dead ends: 1925 [2024-10-31 21:57:45,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:57:45,472 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 473 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:45,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 596 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 21:57:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2024-10-31 21:57:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1675. [2024-10-31 21:57:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1274 states have (on average 1.3720565149136579) internal successors, (1748), 1284 states have internal predecessors, (1748), 340 states have call successors, (340), 60 states have call predecessors, (340), 60 states have return successors, (340), 330 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-31 21:57:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2428 transitions. [2024-10-31 21:57:45,748 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2428 transitions. Word has length 184 [2024-10-31 21:57:45,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:45,749 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2428 transitions. [2024-10-31 21:57:45,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-31 21:57:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2428 transitions. [2024-10-31 21:57:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-31 21:57:45,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:45,753 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] [2024-10-31 21:57:45,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:57:45,753 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:45,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash -388164954, now seen corresponding path program 1 times [2024-10-31 21:57:45,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:45,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673764734] [2024-10-31 21:57:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:45,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:57:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:57:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:57:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:57:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:57:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-31 21:57:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-31 21:57:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:57:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:57:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:57:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:57:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:57:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 21:57:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673764734] [2024-10-31 21:57:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673764734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:46,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:46,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:46,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249205364] [2024-10-31 21:57:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:46,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:46,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:46,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:46,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:46,289 INFO L87 Difference]: Start difference. First operand 1675 states and 2428 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10-31 21:57:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:46,956 INFO L93 Difference]: Finished difference Result 3322 states and 4837 transitions. [2024-10-31 21:57:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:46,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 184 [2024-10-31 21:57:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:46,970 INFO L225 Difference]: With dead ends: 3322 [2024-10-31 21:57:46,970 INFO L226 Difference]: Without dead ends: 2479 [2024-10-31 21:57:46,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:46,974 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 265 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:46,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 602 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:57:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2024-10-31 21:57:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2273. [2024-10-31 21:57:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2273 states, 1740 states have (on average 1.3816091954022989) internal successors, (2404), 1750 states have internal predecessors, (2404), 452 states have call successors, (452), 80 states have call predecessors, (452), 80 states have return successors, (452), 442 states have call predecessors, (452), 452 states have call successors, (452) [2024-10-31 21:57:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 3308 transitions. [2024-10-31 21:57:47,344 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 3308 transitions. Word has length 184 [2024-10-31 21:57:47,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:47,345 INFO L471 AbstractCegarLoop]: Abstraction has 2273 states and 3308 transitions. [2024-10-31 21:57:47,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10-31 21:57:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 3308 transitions. [2024-10-31 21:57:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-31 21:57:47,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:47,348 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] [2024-10-31 21:57:47,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:57:47,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:47,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:47,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1762646155, now seen corresponding path program 1 times [2024-10-31 21:57:47,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:47,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993227999] [2024-10-31 21:57:47,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:47,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:57:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:57:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:57:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:57:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:57:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-31 21:57:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-31 21:57:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:57:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:57:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:57:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:57:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:57:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 21:57:47,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:47,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993227999] [2024-10-31 21:57:47,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993227999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:47,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:47,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:57:47,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734291707] [2024-10-31 21:57:47,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:47,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:57:47,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:47,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:57:47,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:57:47,975 INFO L87 Difference]: Start difference. First operand 2273 states and 3308 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-31 21:57:49,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:49,142 INFO L93 Difference]: Finished difference Result 4567 states and 6639 transitions. [2024-10-31 21:57:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:57:49,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 184 [2024-10-31 21:57:49,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:49,158 INFO L225 Difference]: With dead ends: 4567 [2024-10-31 21:57:49,158 INFO L226 Difference]: Without dead ends: 2297 [2024-10-31 21:57:49,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-31 21:57:49,169 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 443 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:49,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 757 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 21:57:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-10-31 21:57:49,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2277. [2024-10-31 21:57:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 1744 states have (on average 1.37901376146789) internal successors, (2405), 1754 states have internal predecessors, (2405), 452 states have call successors, (452), 80 states have call predecessors, (452), 80 states have return successors, (452), 442 states have call predecessors, (452), 452 states have call successors, (452) [2024-10-31 21:57:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3309 transitions. [2024-10-31 21:57:49,495 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3309 transitions. Word has length 184 [2024-10-31 21:57:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:49,496 INFO L471 AbstractCegarLoop]: Abstraction has 2277 states and 3309 transitions. [2024-10-31 21:57:49,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-31 21:57:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3309 transitions. [2024-10-31 21:57:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-31 21:57:49,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:49,514 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] [2024-10-31 21:57:49,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:57:49,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:49,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash 397380194, now seen corresponding path program 1 times [2024-10-31 21:57:49,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:49,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631018806] [2024-10-31 21:57:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 21:57:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:57:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 21:57:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:57:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 21:57:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-31 21:57:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-31 21:57:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-31 21:57:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-31 21:57:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-31 21:57:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-31 21:57:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-31 21:57:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-31 21:57:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-31 21:57:50,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:50,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631018806] [2024-10-31 21:57:50,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631018806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:50,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:50,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 21:57:50,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176549275] [2024-10-31 21:57:50,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:50,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 21:57:50,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:50,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 21:57:50,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:57:50,231 INFO L87 Difference]: Start difference. First operand 2277 states and 3309 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-31 21:57:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:52,686 INFO L93 Difference]: Finished difference Result 3855 states and 5588 transitions. [2024-10-31 21:57:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 21:57:52,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 185 [2024-10-31 21:57:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:52,702 INFO L225 Difference]: With dead ends: 3855 [2024-10-31 21:57:52,703 INFO L226 Difference]: Without dead ends: 2653 [2024-10-31 21:57:52,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2024-10-31 21:57:52,708 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 467 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:52,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1588 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-31 21:57:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2024-10-31 21:57:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2494. [2024-10-31 21:57:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 1914 states have (on average 1.3756530825496343) internal successors, (2633), 1926 states have internal predecessors, (2633), 492 states have call successors, (492), 87 states have call predecessors, (492), 87 states have return successors, (492), 480 states have call predecessors, (492), 492 states have call successors, (492) [2024-10-31 21:57:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 3617 transitions. [2024-10-31 21:57:53,097 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 3617 transitions. Word has length 185 [2024-10-31 21:57:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:53,098 INFO L471 AbstractCegarLoop]: Abstraction has 2494 states and 3617 transitions. [2024-10-31 21:57:53,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-31 21:57:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 3617 transitions. [2024-10-31 21:57:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-31 21:57:53,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:53,101 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] [2024-10-31 21:57:53,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:57:53,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:53,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash 273564337, now seen corresponding path program 1 times [2024-10-31 21:57:53,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:53,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264371655] [2024-10-31 21:57:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 21:57:53,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113000394] [2024-10-31 21:57:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:53,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:53,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:53,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:57:53,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 21:57:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:53,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:57:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:53,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:57:53,731 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:57:53,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 21:57:53,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 21:57:53,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:53,939 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:54,135 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:57:54,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:57:54 BoogieIcfgContainer [2024-10-31 21:57:54,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:57:54,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:57:54,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:57:54,140 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:57:54,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:31" (3/4) ... [2024-10-31 21:57:54,143 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 21:57:54,144 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:57:54,145 INFO L158 Benchmark]: Toolchain (without parser) took 24105.24ms. Allocated memory was 121.6MB in the beginning and 421.5MB in the end (delta: 299.9MB). Free memory was 79.7MB in the beginning and 157.1MB in the end (delta: -77.3MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2024-10-31 21:57:54,145 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:57:54,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.47ms. Allocated memory is still 121.6MB. Free memory was 79.5MB in the beginning and 62.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 21:57:54,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.36ms. Allocated memory is still 121.6MB. Free memory was 62.2MB in the beginning and 57.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:57:54,146 INFO L158 Benchmark]: Boogie Preprocessor took 129.54ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 57.1MB in the beginning and 126.6MB in the end (delta: -69.5MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-10-31 21:57:54,147 INFO L158 Benchmark]: RCFGBuilder took 955.06ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 99.2MB in the end (delta: 27.3MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-10-31 21:57:54,147 INFO L158 Benchmark]: TraceAbstraction took 22469.18ms. Allocated memory was 159.4MB in the beginning and 421.5MB in the end (delta: 262.1MB). Free memory was 98.7MB in the beginning and 157.1MB in the end (delta: -58.4MB). Peak memory consumption was 203.8MB. Max. memory is 16.1GB. [2024-10-31 21:57:54,147 INFO L158 Benchmark]: Witness Printer took 5.13ms. Allocated memory is still 421.5MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:57:54,149 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.26ms. Allocated memory is still 121.6MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.47ms. Allocated memory is still 121.6MB. Free memory was 79.5MB in the beginning and 62.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.36ms. Allocated memory is still 121.6MB. Free memory was 62.2MB in the beginning and 57.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.54ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 57.1MB in the beginning and 126.6MB in the end (delta: -69.5MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * RCFGBuilder took 955.06ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 99.2MB in the end (delta: 27.3MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22469.18ms. Allocated memory was 159.4MB in the beginning and 421.5MB in the end (delta: 262.1MB). Free memory was 98.7MB in the beginning and 157.1MB in the end (delta: -58.4MB). Peak memory consumption was 203.8MB. Max. memory is 16.1GB. * Witness Printer took 5.13ms. Allocated memory is still 421.5MB. Free memory is still 157.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 168, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of bitwiseOr at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] unsigned short int var_1_25 = 2; [L39] unsigned short int var_1_26 = 1; [L40] unsigned short int var_1_27 = 64; [L41] signed long int var_1_28 = -4; [L42] unsigned long int var_1_29 = 10; [L43] unsigned char var_1_30 = 4; [L44] unsigned char var_1_31 = 16; [L45] signed long int var_1_32 = 8; [L46] float var_1_33 = 24.55; [L47] signed long int var_1_34 = 5; [L48] unsigned short int var_1_35 = 256; [L49] unsigned char var_1_36 = 0; [L50] unsigned long int last_1_var_1_10 = 256; [L51] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L164] last_1_var_1_10 = var_1_10 [L165] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L175] RET updateLastVariables() [L176] CALL updateVariables() [L119] var_1_3 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L120] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L121] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L121] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L122] var_1_5 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L123] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L124] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L124] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L125] var_1_13 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L126] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L127] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L127] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L128] var_1_14 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L130] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L130] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L131] var_1_15 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L132] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L133] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L133] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L134] var_1_16 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L135] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L136] var_1_21 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L137] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L138] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L138] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L139] var_1_22 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L140] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L141] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L141] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L142] var_1_25 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L143] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L144] CALL assume_abort_if_not(var_1_25 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L144] RET assume_abort_if_not(var_1_25 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L145] var_1_26 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L146] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L147] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L147] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L148] var_1_27 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L149] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L150] CALL assume_abort_if_not(var_1_27 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L150] RET assume_abort_if_not(var_1_27 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L151] var_1_31 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L152] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L153] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L153] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L154] var_1_33 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L155] RET assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L156] var_1_34 = __VERIFIER_nondet_long() [L157] CALL assume_abort_if_not(var_1_34 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L157] RET assume_abort_if_not(var_1_34 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L158] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L158] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-127, var_1_6=256] [L159] var_1_36 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-127, var_1_6=256] [L160] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-127, var_1_6=256] [L161] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L161] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L176] RET updateVariables() [L177] CALL step() [L55] COND FALSE !(var_1_25 >= ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L58] var_1_28 = var_1_27 [L59] var_1_29 = var_1_26 [L60] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L61] COND FALSE !(((((1.25f) < 0 ) ? -(1.25f) : (1.25f))) != var_1_33) [L68] var_1_32 = var_1_30 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L70] COND TRUE \read(var_1_36) [L71] var_1_35 = ((((var_1_30) > (((((128) < 0 ) ? -(128) : (128))))) ? (var_1_30) : (((((128) < 0 ) ? -(128) : (128)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L73] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L78] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-16129, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L79] COND TRUE stepLocal_2 > last_1_var_1_10 [L80] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L82] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L83] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L87] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L88] COND FALSE !(stepLocal_1 || var_1_3) [L93] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L95] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L106] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L111] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L111] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L112] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L177] RET step() [L178] CALL, EXPR property() [L168] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L168-L169] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=66, var_1_21=127, var_1_22=58, var_1_23=64, var_1_24=5, var_1_25=0, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-127, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 11, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2979 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2979 mSDsluCounter, 5782 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3829 mSDsCounter, 1132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2405 IncrementalHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1132 mSolverCounterUnsat, 1953 mSDtfsCounter, 2405 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1062 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2494occurred in iteration=10, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 723 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 2382 NumberOfCodeBlocks, 2382 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2183 ConstructedInterpolants, 0 QuantifiedInterpolants, 9075 SizeOfPredicates, 7 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 17820/18144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 21:57:54,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b309c43c-335a-4f12-a985-023931748970/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...