./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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 83a0614c205e8509abb6374f77d17b7065a071e3abf638495a02812bdb5a5d68 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:12:49,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:12:49,590 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:12:49,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:12:49,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:12:49,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:12:49,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:12:49,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:12:49,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:12:49,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:12:49,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:12:49,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:12:49,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:12:49,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:12:49,638 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:12:49,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:12:49,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:12:49,640 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:12:49,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:12:49,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:12:49,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:12:49,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:12:49,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:12:49,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:12:49,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:12:49,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:12:49,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:12:49,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:12:49,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:12:49,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:12:49,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:12:49,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:12:49,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:12:49,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:12:49,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:12:49,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:12:49,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:12:49,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:12:49,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:12:49,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:12:49,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:12:49,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:12:49,668 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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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 -> 83a0614c205e8509abb6374f77d17b7065a071e3abf638495a02812bdb5a5d68 [2024-10-31 22:12:49,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:12:50,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:12:50,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:12:50,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:12:50,029 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:12:50,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i Unable to find full path for "g++" [2024-10-31 22:12:52,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:12:52,492 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:12:52,496 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i [2024-10-31 22:12:52,524 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/data/a4589a1b8/0d42a2a64ac847239621a7835a64cae9/FLAG053a20541 [2024-10-31 22:12:52,539 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/data/a4589a1b8/0d42a2a64ac847239621a7835a64cae9 [2024-10-31 22:12:52,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:12:52,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:12:52,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:12:52,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:12:52,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:12:52,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:12:52" (1/1) ... [2024-10-31 22:12:52,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d19c57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:52, skipping insertion in model container [2024-10-31 22:12:52,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:12:52" (1/1) ... [2024-10-31 22:12:52,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:12:52,840 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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i[913,926] [2024-10-31 22:12:52,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:12:52,964 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:12:52,983 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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i[913,926] [2024-10-31 22:12:53,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:12:53,063 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:12:53,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53 WrapperNode [2024-10-31 22:12:53,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:12:53,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:12:53,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:12:53,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:12:53,074 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:12:53" (1/1) ... [2024-10-31 22:12:53,089 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:12:53" (1/1) ... [2024-10-31 22:12:53,142 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-10-31 22:12:53,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:12:53,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:12:53,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:12:53,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:12:53,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53" (1/1) ... [2024-10-31 22:12:53,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53" (1/1) ... [2024-10-31 22:12:53,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53" (1/1) ... [2024-10-31 22:12:53,202 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:12:53,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53" (1/1) ... [2024-10-31 22:12:53,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53" (1/1) ... [2024-10-31 22:12:53,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53" (1/1) ... [2024-10-31 22:12:53,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53" (1/1) ... [2024-10-31 22:12:53,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53" (1/1) ... [2024-10-31 22:12:53,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53" (1/1) ... [2024-10-31 22:12:53,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:12:53,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:12:53,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:12:53,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:12:53,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53" (1/1) ... [2024-10-31 22:12:53,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:12:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:12:53,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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:12:53,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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:12:53,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:12:53,376 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:12:53,376 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:12:53,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:12:53,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:12:53,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:12:53,508 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:12:53,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:12:53,943 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-31 22:12:53,943 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:12:53,957 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:12:53,958 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:12:53,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:12:53 BoogieIcfgContainer [2024-10-31 22:12:53,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:12:53,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:12:53,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:12:53,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:12:53,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:12:52" (1/3) ... [2024-10-31 22:12:53,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d75178c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:12:53, skipping insertion in model container [2024-10-31 22:12:53,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:12:53" (2/3) ... [2024-10-31 22:12:53,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d75178c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:12:53, skipping insertion in model container [2024-10-31 22:12:53,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:12:53" (3/3) ... [2024-10-31 22:12:53,975 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-30.i [2024-10-31 22:12:53,998 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:12:53,998 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:12:54,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:12:54,078 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;@7db05218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:12:54,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:12:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:12:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-31 22:12:54,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:12:54,100 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:54,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:12:54,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1637055942, now seen corresponding path program 1 times [2024-10-31 22:12:54,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:54,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627055037] [2024-10-31 22:12:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:54,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:12:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:54,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:12:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:54,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:12:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:54,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:12:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:54,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:12:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:54,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:12:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:54,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:12:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:54,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:12:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:54,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:12:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:12:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:12:54,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:54,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627055037] [2024-10-31 22:12:54,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627055037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:54,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:54,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:12:54,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997532458] [2024-10-31 22:12:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:54,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:12:54,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:12:54,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:12:54,552 INFO L87 Difference]: Start difference. First operand has 60 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:12:54,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:12:54,577 INFO L93 Difference]: Finished difference Result 113 states and 184 transitions. [2024-10-31 22:12:54,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:12:54,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2024-10-31 22:12:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:12:54,592 INFO L225 Difference]: With dead ends: 113 [2024-10-31 22:12:54,593 INFO L226 Difference]: Without dead ends: 56 [2024-10-31 22:12:54,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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:12:54,601 INFO L432 NwaCegarLoop]: 83 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, 83 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:12:54,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:12:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-31 22:12:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-31 22:12:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:12:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2024-10-31 22:12:54,652 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 78 [2024-10-31 22:12:54,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:12:54,654 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2024-10-31 22:12:54,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:12:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2024-10-31 22:12:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-31 22:12:54,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:12:54,662 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:54,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:12:54,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:12:54,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1038080014, now seen corresponding path program 1 times [2024-10-31 22:12:54,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:54,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183556306] [2024-10-31 22:12:54,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:12:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:12:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:12:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:12:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:12:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:12:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:12:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:12:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:12:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:12:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:12:55,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:55,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183556306] [2024-10-31 22:12:55,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183556306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:55,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:55,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:12:55,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112495233] [2024-10-31 22:12:55,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:12:55,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:55,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:12:55,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:12:55,304 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:12:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:12:55,468 INFO L93 Difference]: Finished difference Result 189 states and 285 transitions. [2024-10-31 22:12:55,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:12:55,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2024-10-31 22:12:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:12:55,471 INFO L225 Difference]: With dead ends: 189 [2024-10-31 22:12:55,472 INFO L226 Difference]: Without dead ends: 136 [2024-10-31 22:12:55,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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:12:55,474 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 108 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:12:55,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 263 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:12:55,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-31 22:12:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 107. [2024-10-31 22:12:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:12:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2024-10-31 22:12:55,503 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 78 [2024-10-31 22:12:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:12:55,507 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2024-10-31 22:12:55,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:12:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2024-10-31 22:12:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-31 22:12:55,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:12:55,509 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:55,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:12:55,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:12:55,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash 283548741, now seen corresponding path program 1 times [2024-10-31 22:12:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:55,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625721498] [2024-10-31 22:12:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:55,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:12:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:12:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:55,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:12:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:56,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:12:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:56,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:12:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:12:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:12:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:56,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:12:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:56,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:12:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:12:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-31 22:12:56,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:56,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625721498] [2024-10-31 22:12:56,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625721498] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:12:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967612281] [2024-10-31 22:12:56,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:56,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:12:56,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:12:56,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:12:56,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:12:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:56,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-31 22:12:56,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:12:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 20 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-31 22:12:56,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:12:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-31 22:12:56,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967612281] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:12:56,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:12:56,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-31 22:12:56,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464096725] [2024-10-31 22:12:56,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:12:56,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:12:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:12:56,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:12:56,947 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-31 22:12:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:12:57,394 INFO L93 Difference]: Finished difference Result 206 states and 296 transitions. [2024-10-31 22:12:57,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:12:57,394 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 79 [2024-10-31 22:12:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:12:57,396 INFO L225 Difference]: With dead ends: 206 [2024-10-31 22:12:57,396 INFO L226 Difference]: Without dead ends: 153 [2024-10-31 22:12:57,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-10-31 22:12:57,399 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 406 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:12:57,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 329 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:12:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-31 22:12:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2024-10-31 22:12:57,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.34375) internal successors, (129), 96 states have internal predecessors, (129), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:12:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 169 transitions. [2024-10-31 22:12:57,423 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 169 transitions. Word has length 79 [2024-10-31 22:12:57,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:12:57,424 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 169 transitions. [2024-10-31 22:12:57,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-31 22:12:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 169 transitions. [2024-10-31 22:12:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:12:57,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:12:57,426 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:57,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:12:57,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:12:57,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:12:57,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1799865320, now seen corresponding path program 1 times [2024-10-31 22:12:57,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:57,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088370260] [2024-10-31 22:12:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:57,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:12:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:57,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:12:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:57,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:12:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:57,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:12:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:12:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:57,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:12:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:57,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:12:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:57,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:12:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:57,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:12:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:57,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:12:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:12:57,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088370260] [2024-10-31 22:12:57,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088370260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:57,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:57,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:12:57,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475394910] [2024-10-31 22:12:57,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:57,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:12:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:57,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:12:57,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:12:57,768 INFO L87 Difference]: Start difference. First operand 123 states and 169 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:12:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:12:57,827 INFO L93 Difference]: Finished difference Result 243 states and 335 transitions. [2024-10-31 22:12:57,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:12:57,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 80 [2024-10-31 22:12:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:12:57,832 INFO L225 Difference]: With dead ends: 243 [2024-10-31 22:12:57,832 INFO L226 Difference]: Without dead ends: 123 [2024-10-31 22:12:57,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:12:57,837 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:12:57,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:12:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-31 22:12:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-31 22:12:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:12:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 167 transitions. [2024-10-31 22:12:57,870 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 167 transitions. Word has length 80 [2024-10-31 22:12:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:12:57,871 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 167 transitions. [2024-10-31 22:12:57,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:12:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 167 transitions. [2024-10-31 22:12:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-31 22:12:57,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:12:57,876 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:57,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:12:57,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:12:57,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash 186109326, now seen corresponding path program 1 times [2024-10-31 22:12:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:57,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625766253] [2024-10-31 22:12:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:57,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:58,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:12:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:58,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:12:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:58,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:12:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:58,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:12:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:58,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:12:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:58,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:12:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:12:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:58,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:12:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:12:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:58,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:12:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:12:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:12:58,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:12:58,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625766253] [2024-10-31 22:12:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625766253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:12:58,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:12:58,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:12:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247563501] [2024-10-31 22:12:58,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:12:58,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:12:58,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:12:58,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:12:58,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:12:58,472 INFO L87 Difference]: Start difference. First operand 123 states and 167 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:12:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:12:58,606 INFO L93 Difference]: Finished difference Result 212 states and 290 transitions. [2024-10-31 22:12:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:12:58,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2024-10-31 22:12:58,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:12:58,610 INFO L225 Difference]: With dead ends: 212 [2024-10-31 22:12:58,610 INFO L226 Difference]: Without dead ends: 151 [2024-10-31 22:12:58,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:12:58,612 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:12:58,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 213 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:12:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-31 22:12:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 127. [2024-10-31 22:12:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:12:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 171 transitions. [2024-10-31 22:12:58,657 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 171 transitions. Word has length 81 [2024-10-31 22:12:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:12:58,658 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 171 transitions. [2024-10-31 22:12:58,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:12:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 171 transitions. [2024-10-31 22:12:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-31 22:12:58,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:12:58,664 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:58,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:12:58,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:12:58,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:12:58,665 INFO L85 PathProgramCache]: Analyzing trace with hash -72056112, now seen corresponding path program 1 times [2024-10-31 22:12:58,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:12:58,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858479546] [2024-10-31 22:12:58,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:12:58,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:12:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:12:58,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:12:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:12:58,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:12:58,856 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:12:58,858 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:12:58,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:12:58,863 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-31 22:12:58,951 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:12:58,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:12:58 BoogieIcfgContainer [2024-10-31 22:12:58,959 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:12:58,959 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:12:58,959 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:12:58,960 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:12:58,960 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:12:53" (3/4) ... [2024-10-31 22:12:58,963 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:12:58,965 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:12:58,965 INFO L158 Benchmark]: Toolchain (without parser) took 6421.23ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 89.7MB in the beginning and 56.9MB in the end (delta: 32.8MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2024-10-31 22:12:58,966 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 130.0MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:12:58,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.44ms. Allocated memory is still 130.0MB. Free memory was 89.3MB in the beginning and 74.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 22:12:58,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.07ms. Allocated memory is still 130.0MB. Free memory was 74.6MB in the beginning and 72.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:12:58,967 INFO L158 Benchmark]: Boogie Preprocessor took 74.39ms. Allocated memory is still 130.0MB. Free memory was 72.5MB in the beginning and 70.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:12:58,967 INFO L158 Benchmark]: RCFGBuilder took 736.54ms. Allocated memory is still 130.0MB. Free memory was 70.0MB in the beginning and 52.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:12:58,968 INFO L158 Benchmark]: TraceAbstraction took 4997.85ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 51.5MB in the beginning and 56.9MB in the end (delta: -5.4MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2024-10-31 22:12:58,968 INFO L158 Benchmark]: Witness Printer took 5.60ms. Allocated memory is still 180.4MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:12:58,972 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.34ms. Allocated memory is still 130.0MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.44ms. Allocated memory is still 130.0MB. Free memory was 89.3MB in the beginning and 74.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.07ms. Allocated memory is still 130.0MB. Free memory was 74.6MB in the beginning and 72.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.39ms. Allocated memory is still 130.0MB. Free memory was 72.5MB in the beginning and 70.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 736.54ms. Allocated memory is still 130.0MB. Free memory was 70.0MB in the beginning and 52.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4997.85ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 51.5MB in the beginning and 56.9MB in the end (delta: -5.4MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * Witness Printer took 5.60ms. Allocated memory is still 180.4MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] unsigned char last_1_var_1_1 = 1; [L36] signed long int last_1_var_1_11 = -2; [L37] signed long int last_1_var_1_15 = 1000; [L38] double last_1_var_1_16 = 0.2; VAL [isInitial=0, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L114] last_1_var_1_1 = var_1_1 [L115] last_1_var_1_11 = var_1_11 [L116] last_1_var_1_15 = var_1_15 [L117] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L96] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L97] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L97] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L98] var_1_7 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L99] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L100] var_1_10 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L101] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L102] var_1_13 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L103] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L104] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L104] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L105] var_1_14 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L106] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L107] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L107] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L108] var_1_17 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L109] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L110] var_1_18 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L111] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L128] RET updateVariables() [L129] CALL step() [L42] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L43] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L44] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L49] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L50] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L51] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L53] signed long int stepLocal_2 = var_1_11; [L54] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L55] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L56] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L57] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L58] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L64] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L64] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L75] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L77] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L78] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L82] COND FALSE !(10.55f < var_1_16) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L87] COND TRUE var_1_16 > var_1_7 [L88] var_1_8 = var_1_10 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L120-L121] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 553 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 552 mSDsluCounter, 1023 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 601 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 422 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 547 ConstructedInterpolants, 0 QuantifiedInterpolants, 1177 SizeOfPredicates, 1 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 1158/1260 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:12:59,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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 83a0614c205e8509abb6374f77d17b7065a071e3abf638495a02812bdb5a5d68 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:13:01,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:13:01,427 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:13:01,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:13:01,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:13:01,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:13:01,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:13:01,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:13:01,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:13:01,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:13:01,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:13:01,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:13:01,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:13:01,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:13:01,470 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:13:01,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:13:01,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:13:01,471 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:13:01,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:13:01,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:13:01,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:13:01,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:13:01,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:13:01,477 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:13:01,478 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:13:01,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:13:01,478 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:13:01,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:13:01,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:13:01,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:13:01,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:13:01,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:13:01,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:13:01,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:13:01,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:01,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:13:01,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:13:01,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:13:01,485 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:13:01,485 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:13:01,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:13:01,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:13:01,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:13:01,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:13:01,489 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:13:01,489 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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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 -> 83a0614c205e8509abb6374f77d17b7065a071e3abf638495a02812bdb5a5d68 [2024-10-31 22:13:01,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:13:01,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:13:01,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:13:01,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:13:01,924 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:13:01,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i Unable to find full path for "g++" [2024-10-31 22:13:03,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:13:04,266 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:13:04,267 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i [2024-10-31 22:13:04,280 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/data/918af568a/b2f4290959bc4a45b64316ef2f282085/FLAG17833b279 [2024-10-31 22:13:04,308 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/data/918af568a/b2f4290959bc4a45b64316ef2f282085 [2024-10-31 22:13:04,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:13:04,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:13:04,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:04,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:13:04,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:13:04,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33382ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04, skipping insertion in model container [2024-10-31 22:13:04,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:13:04,614 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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i[913,926] [2024-10-31 22:13:04,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:04,724 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:13:04,738 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_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-30.i[913,926] [2024-10-31 22:13:04,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:04,844 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:13:04,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04 WrapperNode [2024-10-31 22:13:04,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:04,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:04,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:13:04,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:13:04,855 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:13:04" (1/1) ... [2024-10-31 22:13:04,874 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:13:04" (1/1) ... [2024-10-31 22:13:04,901 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-31 22:13:04,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:04,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:13:04,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:13:04,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:13:04,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,935 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:13:04,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:13:04,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:13:04,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:13:04,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:13:04,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04" (1/1) ... [2024-10-31 22:13:04,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:04,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:05,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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:13:05,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/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:13:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:13:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:13:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:13:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:13:05,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:13:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:13:05,136 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:13:05,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:13:18,137 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-31 22:13:18,137 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:13:18,150 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:13:18,150 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:13:18,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:18 BoogieIcfgContainer [2024-10-31 22:13:18,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:13:18,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:13:18,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:13:18,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:13:18,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:13:04" (1/3) ... [2024-10-31 22:13:18,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630b8c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:18, skipping insertion in model container [2024-10-31 22:13:18,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:04" (2/3) ... [2024-10-31 22:13:18,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630b8c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:18, skipping insertion in model container [2024-10-31 22:13:18,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:18" (3/3) ... [2024-10-31 22:13:18,161 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-30.i [2024-10-31 22:13:18,182 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:13:18,182 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:13:18,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:13:18,276 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;@3c18284a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:13:18,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:13:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:13:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-31 22:13:18,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:18,289 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:18,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:18,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:18,296 INFO L85 PathProgramCache]: Analyzing trace with hash 8599864, now seen corresponding path program 1 times [2024-10-31 22:13:18,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:18,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909094483] [2024-10-31 22:13:18,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:18,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:13:18,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:18,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:13:18,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-31 22:13:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:18,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:13:19,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-31 22:13:19,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:19,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:19,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909094483] [2024-10-31 22:13:19,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909094483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:19,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061261176] [2024-10-31 22:13:19,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:19,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:13:19,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:19,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:13:19,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:13:19,076 INFO L87 Difference]: Start difference. First operand has 51 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:13:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:19,115 INFO L93 Difference]: Finished difference Result 95 states and 156 transitions. [2024-10-31 22:13:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:13:19,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 75 [2024-10-31 22:13:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:19,128 INFO L225 Difference]: With dead ends: 95 [2024-10-31 22:13:19,128 INFO L226 Difference]: Without dead ends: 47 [2024-10-31 22:13:19,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:13:19,139 INFO L432 NwaCegarLoop]: 69 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, 69 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:13:19,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:13:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-31 22:13:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-31 22:13:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:13:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2024-10-31 22:13:19,197 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 69 transitions. Word has length 75 [2024-10-31 22:13:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:19,200 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 69 transitions. [2024-10-31 22:13:19,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:13:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 69 transitions. [2024-10-31 22:13:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-31 22:13:19,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:19,205 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:19,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-31 22:13:19,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:13:19,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:19,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:19,408 INFO L85 PathProgramCache]: Analyzing trace with hash -657445248, now seen corresponding path program 1 times [2024-10-31 22:13:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:19,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58818639] [2024-10-31 22:13:19,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:19,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:13:19,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:19,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:13:19,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fb08549-e3ac-4d38-9b0d-23f0956bb13a/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-31 22:13:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:19,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:13:19,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:13:20,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:20,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:20,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58818639] [2024-10-31 22:13:20,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58818639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:20,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:20,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:13:20,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525697873] [2024-10-31 22:13:20,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:20,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:13:20,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:20,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:13:20,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:13:20,735 INFO L87 Difference]: Start difference. First operand 47 states and 69 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:13:25,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []