./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/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_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/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_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/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 c2b5d83791f5c517cc904865b76453ec006da14f7434583f731bc2f7adcccacf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:06:43,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:06:43,973 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:06:43,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:06:43,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:06:44,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:06:44,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:06:44,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:06:44,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:06:44,023 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:06:44,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:06:44,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:06:44,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:06:44,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:06:44,029 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:06:44,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:06:44,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:06:44,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:06:44,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:06:44,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:06:44,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:06:44,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:06:44,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:06:44,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:06:44,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:06:44,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:06:44,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:06:44,034 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:06:44,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:06:44,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:06:44,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:06:44,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:06:44,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:44,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:06:44,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:06:44,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:06:44,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:06:44,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:06:44,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:06:44,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:06:44,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:06:44,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:06:44,043 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_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/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_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/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 -> c2b5d83791f5c517cc904865b76453ec006da14f7434583f731bc2f7adcccacf [2024-10-31 22:06:44,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:06:44,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:06:44,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:06:44,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:06:44,381 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:06:44,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i Unable to find full path for "g++" [2024-10-31 22:06:46,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:06:46,665 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:06:46,666 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-10-31 22:06:46,683 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/data/b6cc6f5af/55ca5f94926d4d099ab0864c5bb5cb48/FLAGa9dfdd860 [2024-10-31 22:06:46,710 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/data/b6cc6f5af/55ca5f94926d4d099ab0864c5bb5cb48 [2024-10-31 22:06:46,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:06:46,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:06:46,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:46,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:06:46,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:06:46,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:46" (1/1) ... [2024-10-31 22:06:46,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bec171f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:46, skipping insertion in model container [2024-10-31 22:06:46,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:46" (1/1) ... [2024-10-31 22:06:46,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:06:46,954 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_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i[919,932] [2024-10-31 22:06:47,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:47,056 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:06:47,070 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_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i[919,932] [2024-10-31 22:06:47,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:47,160 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:06:47,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47 WrapperNode [2024-10-31 22:06:47,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:47,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:47,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:06:47,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:06:47,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,246 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-10-31 22:06:47,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:47,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:06:47,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:06:47,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:06:47,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,304 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 22:06:47,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:06:47,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:06:47,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:06:47,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:06:47,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (1/1) ... [2024-10-31 22:06:47,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:47,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:06:47,387 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:06:47,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:06:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:06:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:06:47,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:06:47,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:06:47,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:06:47,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:06:47,560 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:06:47,563 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:06:48,321 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-31 22:06:48,321 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:06:48,343 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:06:48,343 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:06:48,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:48 BoogieIcfgContainer [2024-10-31 22:06:48,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:06:48,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:06:48,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:06:48,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:06:48,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:06:46" (1/3) ... [2024-10-31 22:06:48,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccf81c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:48, skipping insertion in model container [2024-10-31 22:06:48,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:47" (2/3) ... [2024-10-31 22:06:48,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccf81c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:48, skipping insertion in model container [2024-10-31 22:06:48,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:48" (3/3) ... [2024-10-31 22:06:48,358 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-10-31 22:06:48,378 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:06:48,378 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:06:48,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:06:48,452 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;@2666e0d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:06:48,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:06:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 84 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:06:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-31 22:06:48,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:48,478 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:48,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:48,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1183361948, now seen corresponding path program 1 times [2024-10-31 22:06:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:48,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757763198] [2024-10-31 22:06:48,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:48,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:06:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:06:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:06:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:06:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:06:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:06:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:06:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:06:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:06:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:06:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:48,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:06:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:06:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:06:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:06:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:06:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:06:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:06:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:06:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:06:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:06:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 22:06:49,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757763198] [2024-10-31 22:06:49,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757763198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:49,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:49,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:49,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706618309] [2024-10-31 22:06:49,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:49,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:06:49,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:49,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:06:49,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:06:49,123 INFO L87 Difference]: Start difference. First operand has 106 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 84 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-31 22:06:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:49,164 INFO L93 Difference]: Finished difference Result 205 states and 346 transitions. [2024-10-31 22:06:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:06:49,166 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2024-10-31 22:06:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:49,176 INFO L225 Difference]: With dead ends: 205 [2024-10-31 22:06:49,176 INFO L226 Difference]: Without dead ends: 102 [2024-10-31 22:06:49,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 22:06:49,187 INFO L432 NwaCegarLoop]: 156 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, 156 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 22:06:49,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:06:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-31 22:06:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-31 22:06:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:06:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 156 transitions. [2024-10-31 22:06:49,246 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 156 transitions. Word has length 140 [2024-10-31 22:06:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:49,247 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 156 transitions. [2024-10-31 22:06:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-31 22:06:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2024-10-31 22:06:49,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-31 22:06:49,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:49,251 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:49,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:06:49,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:49,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:49,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1120654700, now seen corresponding path program 1 times [2024-10-31 22:06:49,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:49,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416076048] [2024-10-31 22:06:49,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:49,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:06:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:06:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:06:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:06:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:06:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:06:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:06:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:06:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:06:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:06:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:06:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:06:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:06:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:06:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:06:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:06:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:06:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:06:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:06:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:06:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 22:06:49,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:49,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416076048] [2024-10-31 22:06:49,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416076048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:49,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:49,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:06:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431818431] [2024-10-31 22:06:49,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:49,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:49,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:49,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:49,773 INFO L87 Difference]: Start difference. First operand 102 states and 156 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:49,919 INFO L93 Difference]: Finished difference Result 286 states and 439 transitions. [2024-10-31 22:06:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:49,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-31 22:06:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:49,924 INFO L225 Difference]: With dead ends: 286 [2024-10-31 22:06:49,924 INFO L226 Difference]: Without dead ends: 187 [2024-10-31 22:06:49,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 22:06:49,927 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 139 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:49,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 360 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:06:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-31 22:06:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2024-10-31 22:06:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-31 22:06:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 254 transitions. [2024-10-31 22:06:49,975 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 254 transitions. Word has length 140 [2024-10-31 22:06:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:49,979 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 254 transitions. [2024-10-31 22:06:49,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 254 transitions. [2024-10-31 22:06:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-31 22:06:49,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:49,986 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:49,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:06:49,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:49,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash -159208978, now seen corresponding path program 1 times [2024-10-31 22:06:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:49,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876418634] [2024-10-31 22:06:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:06:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:06:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:06:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:06:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:06:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:06:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:06:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:06:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:06:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:06:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:06:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:06:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:06:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:06:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:06:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:06:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:06:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:06:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:06:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:06:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 22:06:50,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876418634] [2024-10-31 22:06:50,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876418634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:50,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:50,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:06:50,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729693975] [2024-10-31 22:06:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:50,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:50,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:50,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:50,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:50,693 INFO L87 Difference]: Start difference. First operand 170 states and 254 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:50,786 INFO L93 Difference]: Finished difference Result 394 states and 594 transitions. [2024-10-31 22:06:50,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:50,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-31 22:06:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:50,791 INFO L225 Difference]: With dead ends: 394 [2024-10-31 22:06:50,794 INFO L226 Difference]: Without dead ends: 227 [2024-10-31 22:06:50,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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 22:06:50,797 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 51 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:50,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 290 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:06:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-31 22:06:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. [2024-10-31 22:06:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 148 states have internal predecessors, (197), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-31 22:06:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 317 transitions. [2024-10-31 22:06:50,847 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 317 transitions. Word has length 140 [2024-10-31 22:06:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:50,848 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 317 transitions. [2024-10-31 22:06:50,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 317 transitions. [2024-10-31 22:06:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-31 22:06:50,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:50,858 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:50,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:06:50,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:50,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:50,859 INFO L85 PathProgramCache]: Analyzing trace with hash 263492848, now seen corresponding path program 1 times [2024-10-31 22:06:50,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:50,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883216912] [2024-10-31 22:06:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:06:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:06:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:06:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:06:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:06:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:06:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:06:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:06:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:06:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:06:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:06:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:06:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:06:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:06:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:06:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:06:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:06:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:06:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:06:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:06:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 22:06:51,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:51,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883216912] [2024-10-31 22:06:51,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883216912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:51,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:51,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:06:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461066807] [2024-10-31 22:06:51,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:51,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:06:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:51,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:06:51,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:51,423 INFO L87 Difference]: Start difference. First operand 212 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:51,869 INFO L93 Difference]: Finished difference Result 555 states and 836 transitions. [2024-10-31 22:06:51,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:06:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-31 22:06:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:51,873 INFO L225 Difference]: With dead ends: 555 [2024-10-31 22:06:51,873 INFO L226 Difference]: Without dead ends: 388 [2024-10-31 22:06:51,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:06:51,876 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 236 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:51,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 534 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:06:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-31 22:06:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 371. [2024-10-31 22:06:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 265 states have (on average 1.3396226415094339) internal successors, (355), 265 states have internal predecessors, (355), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-31 22:06:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 555 transitions. [2024-10-31 22:06:51,933 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 555 transitions. Word has length 140 [2024-10-31 22:06:51,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:51,934 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 555 transitions. [2024-10-31 22:06:51,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 555 transitions. [2024-10-31 22:06:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-31 22:06:51,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:51,939 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:51,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:06:51,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:51,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:51,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2115822692, now seen corresponding path program 1 times [2024-10-31 22:06:51,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:51,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324459966] [2024-10-31 22:06:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:51,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:06:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:06:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:06:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:06:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:06:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:06:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:06:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:06:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:06:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:06:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:06:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:06:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:06:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:06:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:06:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:06:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:06:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:06:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:06:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:06:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 22:06:52,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:52,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324459966] [2024-10-31 22:06:52,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324459966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:52,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:52,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:06:52,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728679927] [2024-10-31 22:06:52,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:52,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:06:52,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:52,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:06:52,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:06:52,654 INFO L87 Difference]: Start difference. First operand 371 states and 555 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:53,355 INFO L93 Difference]: Finished difference Result 896 states and 1332 transitions. [2024-10-31 22:06:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:06:53,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-10-31 22:06:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:53,361 INFO L225 Difference]: With dead ends: 896 [2024-10-31 22:06:53,361 INFO L226 Difference]: Without dead ends: 570 [2024-10-31 22:06:53,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:06:53,363 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 252 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:53,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 658 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:06:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-31 22:06:53,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 540. [2024-10-31 22:06:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 392 states have (on average 1.316326530612245) internal successors, (516), 392 states have internal predecessors, (516), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-31 22:06:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 796 transitions. [2024-10-31 22:06:53,427 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 796 transitions. Word has length 141 [2024-10-31 22:06:53,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:53,428 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 796 transitions. [2024-10-31 22:06:53,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 796 transitions. [2024-10-31 22:06:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-31 22:06:53,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:53,430 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:53,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:06:53,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:53,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:53,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1495744966, now seen corresponding path program 1 times [2024-10-31 22:06:53,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:53,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933877540] [2024-10-31 22:06:53,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:53,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:06:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:06:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:06:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:06:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:06:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:06:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:06:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:06:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:06:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:06:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:06:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:06:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:06:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:06:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:06:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:06:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:06:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:06:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:06:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:06:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 22:06:53,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:53,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933877540] [2024-10-31 22:06:53,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933877540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:53,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:53,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:06:53,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204598366] [2024-10-31 22:06:53,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:53,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:06:53,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:53,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:06:53,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:06:53,813 INFO L87 Difference]: Start difference. First operand 540 states and 796 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:54,076 INFO L93 Difference]: Finished difference Result 1141 states and 1706 transitions. [2024-10-31 22:06:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:06:54,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-10-31 22:06:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:54,081 INFO L225 Difference]: With dead ends: 1141 [2024-10-31 22:06:54,082 INFO L226 Difference]: Without dead ends: 646 [2024-10-31 22:06:54,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:54,084 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 301 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:54,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 483 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:06:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-10-31 22:06:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 600. [2024-10-31 22:06:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 448 states have (on average 1.3169642857142858) internal successors, (590), 452 states have internal predecessors, (590), 142 states have call successors, (142), 9 states have call predecessors, (142), 9 states have return successors, (142), 138 states have call predecessors, (142), 142 states have call successors, (142) [2024-10-31 22:06:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 874 transitions. [2024-10-31 22:06:54,153 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 874 transitions. Word has length 142 [2024-10-31 22:06:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:54,155 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 874 transitions. [2024-10-31 22:06:54,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 874 transitions. [2024-10-31 22:06:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-31 22:06:54,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:54,157 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:54,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:06:54,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:54,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:54,158 INFO L85 PathProgramCache]: Analyzing trace with hash -372113381, now seen corresponding path program 1 times [2024-10-31 22:06:54,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:54,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898489295] [2024-10-31 22:06:54,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:06:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:06:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:06:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:06:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:06:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:06:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:06:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:06:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:06:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:06:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:06:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:06:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:06:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:06:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:06:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:06:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:06:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:06:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:06:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:06:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 22:06:54,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898489295] [2024-10-31 22:06:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898489295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:54,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:54,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:06:54,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926712478] [2024-10-31 22:06:54,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:54,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:06:54,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:54,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:06:54,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:06:54,670 INFO L87 Difference]: Start difference. First operand 600 states and 874 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:54,910 INFO L93 Difference]: Finished difference Result 1193 states and 1746 transitions. [2024-10-31 22:06:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:06:54,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-10-31 22:06:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:54,917 INFO L225 Difference]: With dead ends: 1193 [2024-10-31 22:06:54,917 INFO L226 Difference]: Without dead ends: 637 [2024-10-31 22:06:54,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:54,921 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 129 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:54,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 568 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:06:54,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-31 22:06:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 600. [2024-10-31 22:06:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 448 states have (on average 1.296875) internal successors, (581), 452 states have internal predecessors, (581), 142 states have call successors, (142), 9 states have call predecessors, (142), 9 states have return successors, (142), 138 states have call predecessors, (142), 142 states have call successors, (142) [2024-10-31 22:06:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 865 transitions. [2024-10-31 22:06:55,030 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 865 transitions. Word has length 142 [2024-10-31 22:06:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:55,030 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 865 transitions. [2024-10-31 22:06:55,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 865 transitions. [2024-10-31 22:06:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-31 22:06:55,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:55,033 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:55,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:06:55,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:55,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1661701271, now seen corresponding path program 1 times [2024-10-31 22:06:55,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:55,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916943541] [2024-10-31 22:06:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:55,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:06:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:06:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:06:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:06:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:06:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:06:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:06:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:06:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:06:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:06:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:06:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:06:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:06:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:06:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:06:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:06:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:06:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:06:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:06:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:06:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 22:06:55,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:55,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916943541] [2024-10-31 22:06:55,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916943541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:55,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:55,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:06:55,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924666416] [2024-10-31 22:06:55,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:55,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:06:55,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:55,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:06:55,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:06:55,365 INFO L87 Difference]: Start difference. First operand 600 states and 865 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:06:55,933 INFO L93 Difference]: Finished difference Result 915 states and 1333 transitions. [2024-10-31 22:06:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:06:55,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-31 22:06:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:06:55,937 INFO L225 Difference]: With dead ends: 915 [2024-10-31 22:06:55,937 INFO L226 Difference]: Without dead ends: 675 [2024-10-31 22:06:55,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:06:55,939 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 252 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:06:55,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 850 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:06:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-31 22:06:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 600. [2024-10-31 22:06:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 448 states have (on average 1.2946428571428572) internal successors, (580), 452 states have internal predecessors, (580), 142 states have call successors, (142), 9 states have call predecessors, (142), 9 states have return successors, (142), 138 states have call predecessors, (142), 142 states have call successors, (142) [2024-10-31 22:06:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 864 transitions. [2024-10-31 22:06:56,065 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 864 transitions. Word has length 145 [2024-10-31 22:06:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:06:56,066 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 864 transitions. [2024-10-31 22:06:56,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:06:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 864 transitions. [2024-10-31 22:06:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:06:56,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:06:56,068 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:56,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:06:56,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:06:56,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:56,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2077653650, now seen corresponding path program 1 times [2024-10-31 22:06:56,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:56,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557042969] [2024-10-31 22:06:56,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:56,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:07:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:07:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:07:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:07:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:07:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:07:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:07:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:07:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:07:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-31 22:07:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-31 22:07:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-31 22:07:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-31 22:07:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:07:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:07:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-31 22:07:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-31 22:07:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-31 22:07:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-31 22:07:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-31 22:07:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 22:07:05,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557042969] [2024-10-31 22:07:05,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557042969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:05,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:05,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:07:05,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577735342] [2024-10-31 22:07:05,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:05,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:07:05,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:05,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:07:05,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:07:05,722 INFO L87 Difference]: Start difference. First operand 600 states and 864 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:07:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:07:09,581 INFO L93 Difference]: Finished difference Result 1396 states and 1927 transitions. [2024-10-31 22:07:09,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:07:09,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-10-31 22:07:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:07:09,594 INFO L225 Difference]: With dead ends: 1396 [2024-10-31 22:07:09,595 INFO L226 Difference]: Without dead ends: 1001 [2024-10-31 22:07:09,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:07:09,598 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 158 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:07:09,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 600 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-31 22:07:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-10-31 22:07:09,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 914. [2024-10-31 22:07:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 741 states have (on average 1.2645074224021593) internal successors, (937), 752 states have internal predecessors, (937), 156 states have call successors, (156), 16 states have call predecessors, (156), 16 states have return successors, (156), 145 states have call predecessors, (156), 156 states have call successors, (156) [2024-10-31 22:07:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1249 transitions. [2024-10-31 22:07:09,796 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1249 transitions. Word has length 146 [2024-10-31 22:07:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:07:09,797 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1249 transitions. [2024-10-31 22:07:09,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 22:07:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1249 transitions. [2024-10-31 22:07:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:07:09,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:07:09,801 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:09,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:07:09,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:07:09,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:09,803 INFO L85 PathProgramCache]: Analyzing trace with hash 272215316, now seen corresponding path program 1 times [2024-10-31 22:07:09,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:09,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206542673] [2024-10-31 22:07:09,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:09,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 22:07:09,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501488547] [2024-10-31 22:07:09,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:09,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:07:09,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:07:09,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:07:09,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:07:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:07:10,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:07:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:07:10,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:07:10,465 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:07:10,467 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:07:10,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:07:10,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:07:10,672 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:10,816 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:07:10,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:07:10 BoogieIcfgContainer [2024-10-31 22:07:10,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:07:10,822 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:07:10,822 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:07:10,822 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:07:10,823 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:48" (3/4) ... [2024-10-31 22:07:10,826 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:07:10,827 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:07:10,827 INFO L158 Benchmark]: Toolchain (without parser) took 24113.77ms. Allocated memory was 146.8MB in the beginning and 371.2MB in the end (delta: 224.4MB). Free memory was 114.0MB in the beginning and 210.1MB in the end (delta: -96.1MB). Peak memory consumption was 131.4MB. Max. memory is 16.1GB. [2024-10-31 22:07:10,828 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 146.8MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:07:10,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.12ms. Allocated memory is still 146.8MB. Free memory was 113.4MB in the beginning and 96.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:07:10,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.29ms. Allocated memory is still 146.8MB. Free memory was 96.1MB in the beginning and 89.4MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:07:10,829 INFO L158 Benchmark]: Boogie Preprocessor took 90.00ms. Allocated memory is still 146.8MB. Free memory was 89.4MB in the beginning and 80.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-31 22:07:10,829 INFO L158 Benchmark]: RCFGBuilder took 1006.44ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 80.9MB in the beginning and 131.9MB in the end (delta: -50.9MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-10-31 22:07:10,829 INFO L158 Benchmark]: TraceAbstraction took 22474.30ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 130.9MB in the beginning and 211.1MB in the end (delta: -80.2MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. [2024-10-31 22:07:10,830 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 371.2MB. Free memory was 211.1MB in the beginning and 210.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:07:10,832 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.33ms. Allocated memory is still 146.8MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.12ms. Allocated memory is still 146.8MB. Free memory was 113.4MB in the beginning and 96.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.29ms. Allocated memory is still 146.8MB. Free memory was 96.1MB in the beginning and 89.4MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.00ms. Allocated memory is still 146.8MB. Free memory was 89.4MB in the beginning and 80.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1006.44ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 80.9MB in the beginning and 131.9MB in the end (delta: -50.9MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * TraceAbstraction took 22474.30ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 130.9MB in the beginning and 211.1MB in the end (delta: -80.2MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 371.2MB. Free memory was 211.1MB in the beginning and 210.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned short int var_1_29 = 8; [L41] unsigned short int var_1_33 = 48416; [L42] unsigned char var_1_35 = 4; [L43] unsigned long int var_1_37 = 32; [L44] unsigned char var_1_38 = 8; [L45] double var_1_40 = 31.75; [L46] double var_1_41 = 5.5; [L47] signed char var_1_43 = 100; [L48] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L178] isInitial = 1 [L179] FCALL initially() [L180] COND TRUE 1 [L181] CALL updateLastVariables() [L171] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L181] RET updateLastVariables() [L182] CALL updateVariables() [L137] var_1_9 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L139] var_1_10 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L141] var_1_11 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L147] var_1_13 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L150] var_1_14 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L153] var_1_18 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L156] var_1_19 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L157] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L159] var_1_23 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L160] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L162] var_1_33 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L163] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L165] var_1_40 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L166] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L167] var_1_41 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L182] RET updateVariables() [L183] CALL step() [L52] COND FALSE !(\read(var_1_23)) [L57] var_1_24 = ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L59] COND FALSE !((var_1_20 / var_1_12) < var_1_11) [L62] var_1_29 = ((((((((((((var_1_12) < (var_1_8)) ? (var_1_12) : (var_1_8)))) > (var_1_12)) ? (((((var_1_12) < (var_1_8)) ? (var_1_12) : (var_1_8)))) : (var_1_12)))) > ((var_1_33 - var_1_11))) ? (((((((((var_1_12) < (var_1_8)) ? (var_1_12) : (var_1_8)))) > (var_1_12)) ? (((((var_1_12) < (var_1_8)) ? (var_1_12) : (var_1_8)))) : (var_1_12)))) : ((var_1_33 - var_1_11)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L67] COND TRUE ((((var_1_8) < (var_1_12)) ? (var_1_8) : (var_1_12))) >= var_1_20 [L68] var_1_37 = var_1_8 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L70] COND FALSE !((var_1_9 * (var_1_40 - var_1_41)) >= var_1_9) [L77] var_1_38 = var_1_14 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=100, var_1_5=5, var_1_8=0] [L79] COND FALSE !(((((var_1_10) > (64.75f)) ? (var_1_10) : (64.75f))) <= var_1_40) [L86] var_1_43 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L88] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L91] var_1_20 = var_1_8 [L92] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L93] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L96] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L97] COND FALSE !(\read(var_1_22)) [L104] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L106] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L107] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L108] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L109] COND FALSE !(\read(var_1_22)) [L116] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L121] signed long int stepLocal_4 = 256; [L122] unsigned char stepLocal_3 = var_1_22; [L123] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L124] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L127] COND FALSE !(stepLocal_3 || var_1_22) [L132] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L183] RET step() [L184] CALL, EXPR property() [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174-L175] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L184] RET, EXPR property() [L184] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1518 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1518 mSDsluCounter, 4499 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2684 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1157 IncrementalHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 1815 mSDtfsCounter, 1157 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=914occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 324 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 1568 NumberOfCodeBlocks, 1568 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1267 ConstructedInterpolants, 0 QuantifiedInterpolants, 10669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 6840/6840 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 22:07:10,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/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_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/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 c2b5d83791f5c517cc904865b76453ec006da14f7434583f731bc2f7adcccacf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:07:13,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:07:13,450 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e9f0cd1-3bfb-46ad-b728-befcaa0ef5af/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:07:13,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:07:13,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:07:13,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:07:13,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:07:13,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:07:13,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:07:13,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:07:13,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:07:13,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:07:13,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:07:13,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:07:13,509 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:07:13,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:07:13,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:07:13,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:07:13,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:07:13,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:07:13,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:07:13,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:07:13,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:07:13,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:07:13,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:07:13,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:07:13,516 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:07:13,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:07:13,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:07:13,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:07:13,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:07:13,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:07:13,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:07:13,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:07:13,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:13,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:07:13,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:07:13,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:07:13,523 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:07:13,523 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:07:13,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:07:13,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:07:13,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:07:13,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:07:13,533 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:07:13,534 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC