./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ --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 e0b92bdde1a6a66126d19d639f9e494a5579381be868a4b13fb2299a2d0086c0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:42:11,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:42:11,343 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 21:42:11,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:42:11,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:42:11,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:42:11,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:42:11,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:42:11,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 21:42:11,403 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 21:42:11,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:42:11,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:42:11,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:42:11,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:42:11,408 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:42:11,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:42:11,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:42:11,410 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:42:11,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:42:11,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:42:11,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:42:11,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:42:11,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:42:11,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:42:11,414 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:42:11,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:42:11,415 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:42:11,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:42:11,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:42:11,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:42:11,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:42:11,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:42:11,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:42:11,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:42:11,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:42:11,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:42:11,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:42:11,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:42:11,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:42:11,439 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:42:11,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:42:11,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:42:11,440 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_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/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_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ 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 -> e0b92bdde1a6a66126d19d639f9e494a5579381be868a4b13fb2299a2d0086c0 [2023-11-23 21:42:11,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:42:11,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:42:11,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:42:11,815 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:42:11,816 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:42:11,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i [2023-11-23 21:42:15,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:42:15,412 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:42:15,416 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i [2023-11-23 21:42:15,435 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/data/d90b134e1/2dc34c3d908d47cd8ae309d7cb9fde08/FLAGdf5015ef2 [2023-11-23 21:42:15,453 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/data/d90b134e1/2dc34c3d908d47cd8ae309d7cb9fde08 [2023-11-23 21:42:15,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:42:15,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:42:15,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:42:15,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:42:15,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:42:15,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:15,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71650b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15, skipping insertion in model container [2023-11-23 21:42:15,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:15,535 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:42:15,753 WARN L240 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_8a819800-1bcb-48de-ab38-0b7d4609e754/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i[915,928] [2023-11-23 21:42:15,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:42:15,861 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:42:15,876 WARN L240 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_8a819800-1bcb-48de-ab38-0b7d4609e754/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i[915,928] [2023-11-23 21:42:15,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:42:15,984 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:42:15,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15 WrapperNode [2023-11-23 21:42:15,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:42:15,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:42:15,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:42:15,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:42:16,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,079 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2023-11-23 21:42:16,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:42:16,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:42:16,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:42:16,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:42:16,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,100 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,121 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 21:42:16,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:42:16,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:42:16,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:42:16,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:42:16,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (1/1) ... [2023-11-23 21:42:16,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:42:16,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:42:16,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:42:16,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:42:16,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:42:16,242 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 21:42:16,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 21:42:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 21:42:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:42:16,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:42:16,346 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:42:16,349 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:42:16,943 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:42:17,017 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:42:17,017 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 21:42:17,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:42:17 BoogieIcfgContainer [2023-11-23 21:42:17,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:42:17,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:42:17,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:42:17,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:42:17,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:42:15" (1/3) ... [2023-11-23 21:42:17,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288effd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:42:17, skipping insertion in model container [2023-11-23 21:42:17,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:15" (2/3) ... [2023-11-23 21:42:17,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288effd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:42:17, skipping insertion in model container [2023-11-23 21:42:17,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:42:17" (3/3) ... [2023-11-23 21:42:17,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-63.i [2023-11-23 21:42:17,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:42:17,059 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:42:17,175 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:42:17,183 INFO L357 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, mHoare=true, 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;@6c831f66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:42:17,184 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:42:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 21:42:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 21:42:17,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:17,209 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:17,210 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:17,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash -761645166, now seen corresponding path program 1 times [2023-11-23 21:42:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218480351] [2023-11-23 21:42:17,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:17,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:17,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:17,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218480351] [2023-11-23 21:42:17,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218480351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:17,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:17,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:42:17,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463952174] [2023-11-23 21:42:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:17,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 21:42:17,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:17,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 21:42:17,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:42:17,867 INFO L87 Difference]: Start difference. First operand has 63 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 21:42:17,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:17,939 INFO L93 Difference]: Finished difference Result 123 states and 208 transitions. [2023-11-23 21:42:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:42:17,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2023-11-23 21:42:17,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:17,959 INFO L225 Difference]: With dead ends: 123 [2023-11-23 21:42:17,960 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 21:42:17,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:42:17,973 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:17,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:42:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 21:42:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-23 21:42:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 21:42:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 92 transitions. [2023-11-23 21:42:18,064 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 92 transitions. Word has length 113 [2023-11-23 21:42:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:18,065 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 92 transitions. [2023-11-23 21:42:18,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 21:42:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 92 transitions. [2023-11-23 21:42:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 21:42:18,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:18,075 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:18,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:42:18,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:18,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash 493080646, now seen corresponding path program 1 times [2023-11-23 21:42:18,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:18,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924336818] [2023-11-23 21:42:18,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:18,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:18,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924336818] [2023-11-23 21:42:18,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924336818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:18,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:42:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564995563] [2023-11-23 21:42:18,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:18,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:42:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:18,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:42:18,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:42:18,644 INFO L87 Difference]: Start difference. First operand 61 states and 92 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:18,761 INFO L93 Difference]: Finished difference Result 146 states and 221 transitions. [2023-11-23 21:42:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:42:18,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-23 21:42:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:18,768 INFO L225 Difference]: With dead ends: 146 [2023-11-23 21:42:18,769 INFO L226 Difference]: Without dead ends: 86 [2023-11-23 21:42:18,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:42:18,775 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 28 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:18,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 184 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:42:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-23 21:42:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2023-11-23 21:42:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 21:42:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2023-11-23 21:42:18,806 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 113 [2023-11-23 21:42:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:18,812 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2023-11-23 21:42:18,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2023-11-23 21:42:18,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 21:42:18,821 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:18,822 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:18,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:42:18,822 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:18,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1205555334, now seen corresponding path program 1 times [2023-11-23 21:42:18,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:18,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268789197] [2023-11-23 21:42:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:19,422 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:19,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:19,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268789197] [2023-11-23 21:42:19,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268789197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:19,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:19,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:42:19,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112759683] [2023-11-23 21:42:19,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:19,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:42:19,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:19,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:42:19,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:42:19,431 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:19,797 INFO L93 Difference]: Finished difference Result 270 states and 403 transitions. [2023-11-23 21:42:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:42:19,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-23 21:42:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:19,802 INFO L225 Difference]: With dead ends: 270 [2023-11-23 21:42:19,802 INFO L226 Difference]: Without dead ends: 198 [2023-11-23 21:42:19,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:42:19,805 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 167 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:19,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 339 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:42:19,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-23 21:42:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 98. [2023-11-23 21:42:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 21:42:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2023-11-23 21:42:19,827 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 113 [2023-11-23 21:42:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:19,828 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2023-11-23 21:42:19,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2023-11-23 21:42:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 21:42:19,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:19,834 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:19,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:42:19,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:19,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:19,835 INFO L85 PathProgramCache]: Analyzing trace with hash 947389896, now seen corresponding path program 1 times [2023-11-23 21:42:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:19,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409233428] [2023-11-23 21:42:19,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:20,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409233428] [2023-11-23 21:42:20,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409233428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:20,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:20,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:42:20,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763818573] [2023-11-23 21:42:20,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:20,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:42:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:20,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:42:20,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:42:20,440 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:20,837 INFO L93 Difference]: Finished difference Result 297 states and 437 transitions. [2023-11-23 21:42:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:42:20,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-23 21:42:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:20,846 INFO L225 Difference]: With dead ends: 297 [2023-11-23 21:42:20,846 INFO L226 Difference]: Without dead ends: 200 [2023-11-23 21:42:20,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:42:20,859 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 164 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:20,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 449 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:42:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-23 21:42:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 100. [2023-11-23 21:42:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 21:42:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2023-11-23 21:42:20,891 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 113 [2023-11-23 21:42:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:20,891 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 148 transitions. [2023-11-23 21:42:20,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 148 transitions. [2023-11-23 21:42:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 21:42:20,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:20,894 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:20,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:42:20,894 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:20,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:20,895 INFO L85 PathProgramCache]: Analyzing trace with hash -74308344, now seen corresponding path program 1 times [2023-11-23 21:42:20,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:20,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782498913] [2023-11-23 21:42:20,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:20,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:21,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:21,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782498913] [2023-11-23 21:42:21,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782498913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:21,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:21,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:42:21,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82281198] [2023-11-23 21:42:21,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:21,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:42:21,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:21,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:42:21,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:42:21,373 INFO L87 Difference]: Start difference. First operand 100 states and 148 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:21,609 INFO L93 Difference]: Finished difference Result 302 states and 446 transitions. [2023-11-23 21:42:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:42:21,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-23 21:42:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:21,612 INFO L225 Difference]: With dead ends: 302 [2023-11-23 21:42:21,612 INFO L226 Difference]: Without dead ends: 203 [2023-11-23 21:42:21,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:42:21,619 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 111 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:21,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 209 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:42:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-23 21:42:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 104. [2023-11-23 21:42:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 21:42:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-11-23 21:42:21,641 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 113 [2023-11-23 21:42:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:21,641 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-11-23 21:42:21,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-11-23 21:42:21,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 21:42:21,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:21,643 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:21,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:42:21,644 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:21,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash -332473782, now seen corresponding path program 1 times [2023-11-23 21:42:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:21,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795601398] [2023-11-23 21:42:21,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:22,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:22,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795601398] [2023-11-23 21:42:22,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795601398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:22,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:22,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 21:42:22,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056593158] [2023-11-23 21:42:22,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:22,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:42:22,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:22,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:42:22,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:42:22,609 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:24,209 INFO L93 Difference]: Finished difference Result 500 states and 728 transitions. [2023-11-23 21:42:24,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-23 21:42:24,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-23 21:42:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:24,215 INFO L225 Difference]: With dead ends: 500 [2023-11-23 21:42:24,216 INFO L226 Difference]: Without dead ends: 396 [2023-11-23 21:42:24,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2023-11-23 21:42:24,220 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 291 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:24,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 819 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 21:42:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-11-23 21:42:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 220. [2023-11-23 21:42:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 185 states have (on average 1.4) internal successors, (259), 185 states have internal predecessors, (259), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 21:42:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 323 transitions. [2023-11-23 21:42:24,292 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 323 transitions. Word has length 113 [2023-11-23 21:42:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:24,293 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 323 transitions. [2023-11-23 21:42:24,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 323 transitions. [2023-11-23 21:42:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 21:42:24,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:24,295 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:24,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:42:24,296 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:24,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:24,296 INFO L85 PathProgramCache]: Analyzing trace with hash 485174668, now seen corresponding path program 1 times [2023-11-23 21:42:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:24,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736609667] [2023-11-23 21:42:24,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:24,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:24,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736609667] [2023-11-23 21:42:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736609667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:24,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:24,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:42:24,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885693127] [2023-11-23 21:42:24,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:24,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:42:24,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:24,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:42:24,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:42:24,871 INFO L87 Difference]: Start difference. First operand 220 states and 323 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:25,368 INFO L93 Difference]: Finished difference Result 539 states and 790 transitions. [2023-11-23 21:42:25,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:42:25,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-23 21:42:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:25,374 INFO L225 Difference]: With dead ends: 539 [2023-11-23 21:42:25,374 INFO L226 Difference]: Without dead ends: 320 [2023-11-23 21:42:25,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:42:25,376 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 77 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:25,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 652 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:42:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-11-23 21:42:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 228. [2023-11-23 21:42:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 193 states have (on average 1.3989637305699483) internal successors, (270), 193 states have internal predecessors, (270), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 21:42:25,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 334 transitions. [2023-11-23 21:42:25,425 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 334 transitions. Word has length 113 [2023-11-23 21:42:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:25,427 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 334 transitions. [2023-11-23 21:42:25,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 334 transitions. [2023-11-23 21:42:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 21:42:25,430 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:25,431 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:25,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:42:25,431 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:25,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:25,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1330155407, now seen corresponding path program 1 times [2023-11-23 21:42:25,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:25,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376125056] [2023-11-23 21:42:25,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:25,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:26,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376125056] [2023-11-23 21:42:26,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376125056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:26,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:26,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 21:42:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365955835] [2023-11-23 21:42:26,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:26,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:42:26,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:26,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:42:26,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:42:26,286 INFO L87 Difference]: Start difference. First operand 228 states and 334 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:27,096 INFO L93 Difference]: Finished difference Result 564 states and 801 transitions. [2023-11-23 21:42:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 21:42:27,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-11-23 21:42:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:27,100 INFO L225 Difference]: With dead ends: 564 [2023-11-23 21:42:27,101 INFO L226 Difference]: Without dead ends: 337 [2023-11-23 21:42:27,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2023-11-23 21:42:27,104 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 109 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:27,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 552 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:42:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-11-23 21:42:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 238. [2023-11-23 21:42:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 203 states have internal predecessors, (270), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 21:42:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 334 transitions. [2023-11-23 21:42:27,164 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 334 transitions. Word has length 114 [2023-11-23 21:42:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:27,165 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 334 transitions. [2023-11-23 21:42:27,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 334 transitions. [2023-11-23 21:42:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 21:42:27,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:27,168 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:27,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:42:27,168 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:27,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash -272565684, now seen corresponding path program 1 times [2023-11-23 21:42:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:27,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528582087] [2023-11-23 21:42:27,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:27,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528582087] [2023-11-23 21:42:27,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528582087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:27,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:42:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767211813] [2023-11-23 21:42:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:27,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:42:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:42:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:42:27,331 INFO L87 Difference]: Start difference. First operand 238 states and 334 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:27,472 INFO L93 Difference]: Finished difference Result 579 states and 813 transitions. [2023-11-23 21:42:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:42:27,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-11-23 21:42:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:27,476 INFO L225 Difference]: With dead ends: 579 [2023-11-23 21:42:27,477 INFO L226 Difference]: Without dead ends: 342 [2023-11-23 21:42:27,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:42:27,480 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 66 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:27,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 175 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:42:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-23 21:42:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 244. [2023-11-23 21:42:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 209 states have (on average 1.30622009569378) internal successors, (273), 209 states have internal predecessors, (273), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 21:42:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 337 transitions. [2023-11-23 21:42:27,548 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 337 transitions. Word has length 114 [2023-11-23 21:42:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:27,548 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 337 transitions. [2023-11-23 21:42:27,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 337 transitions. [2023-11-23 21:42:27,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 21:42:27,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:27,551 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:27,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:42:27,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:27,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1943743535, now seen corresponding path program 1 times [2023-11-23 21:42:27,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235106447] [2023-11-23 21:42:27,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:27,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:28,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235106447] [2023-11-23 21:42:28,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235106447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:28,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:28,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:42:28,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630381543] [2023-11-23 21:42:28,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:28,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:42:28,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:28,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:42:28,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:42:28,059 INFO L87 Difference]: Start difference. First operand 244 states and 337 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:28,499 INFO L93 Difference]: Finished difference Result 511 states and 713 transitions. [2023-11-23 21:42:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:42:28,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-11-23 21:42:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:28,503 INFO L225 Difference]: With dead ends: 511 [2023-11-23 21:42:28,503 INFO L226 Difference]: Without dead ends: 266 [2023-11-23 21:42:28,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:42:28,505 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 111 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:28,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 312 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:42:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-23 21:42:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 224. [2023-11-23 21:42:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 189 states have (on average 1.3015873015873016) internal successors, (246), 189 states have internal predecessors, (246), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 21:42:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions. [2023-11-23 21:42:28,571 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 114 [2023-11-23 21:42:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:28,576 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions. [2023-11-23 21:42:28,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions. [2023-11-23 21:42:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 21:42:28,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:28,579 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:28,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:42:28,579 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:28,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1521041709, now seen corresponding path program 1 times [2023-11-23 21:42:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:28,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293407528] [2023-11-23 21:42:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:29,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293407528] [2023-11-23 21:42:29,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293407528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:29,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:29,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 21:42:29,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645741985] [2023-11-23 21:42:29,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:29,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:42:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:29,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:42:29,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:42:29,311 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:29,906 INFO L93 Difference]: Finished difference Result 450 states and 609 transitions. [2023-11-23 21:42:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 21:42:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2023-11-23 21:42:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:29,910 INFO L225 Difference]: With dead ends: 450 [2023-11-23 21:42:29,910 INFO L226 Difference]: Without dead ends: 328 [2023-11-23 21:42:29,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-23 21:42:29,913 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 76 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:29,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 537 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:42:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-11-23 21:42:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 226. [2023-11-23 21:42:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 states have internal predecessors, (249), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 21:42:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 313 transitions. [2023-11-23 21:42:29,970 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 313 transitions. Word has length 114 [2023-11-23 21:42:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:29,970 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 313 transitions. [2023-11-23 21:42:29,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 313 transitions. [2023-11-23 21:42:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-23 21:42:29,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:29,973 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:29,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:42:29,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:29,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:29,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1787839815, now seen corresponding path program 1 times [2023-11-23 21:42:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071701731] [2023-11-23 21:42:29,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:29,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:30,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:30,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071701731] [2023-11-23 21:42:30,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071701731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:30,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:30,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:42:30,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539568357] [2023-11-23 21:42:30,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:30,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 21:42:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:30,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 21:42:30,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:42:30,497 INFO L87 Difference]: Start difference. First operand 226 states and 313 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:31,266 INFO L93 Difference]: Finished difference Result 547 states and 758 transitions. [2023-11-23 21:42:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 21:42:31,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2023-11-23 21:42:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:31,270 INFO L225 Difference]: With dead ends: 547 [2023-11-23 21:42:31,270 INFO L226 Difference]: Without dead ends: 322 [2023-11-23 21:42:31,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-23 21:42:31,272 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 176 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:31,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 607 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 21:42:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-23 21:42:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 229. [2023-11-23 21:42:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 21:42:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 316 transitions. [2023-11-23 21:42:31,332 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 316 transitions. Word has length 115 [2023-11-23 21:42:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:31,332 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 316 transitions. [2023-11-23 21:42:31,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 316 transitions. [2023-11-23 21:42:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-23 21:42:31,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:31,335 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:31,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 21:42:31,335 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:31,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2005934193, now seen corresponding path program 1 times [2023-11-23 21:42:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:31,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793401380] [2023-11-23 21:42:31,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:31,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 21:42:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:42:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 21:42:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 21:42:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 21:42:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 21:42:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 21:42:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-23 21:42:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 21:42:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793401380] [2023-11-23 21:42:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793401380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:31,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:31,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:42:31,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933690021] [2023-11-23 21:42:31,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:31,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:42:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:31,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:42:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:42:31,477 INFO L87 Difference]: Start difference. First operand 229 states and 316 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:31,617 INFO L93 Difference]: Finished difference Result 545 states and 754 transitions. [2023-11-23 21:42:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:42:31,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2023-11-23 21:42:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:31,620 INFO L225 Difference]: With dead ends: 545 [2023-11-23 21:42:31,621 INFO L226 Difference]: Without dead ends: 317 [2023-11-23 21:42:31,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:42:31,622 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 76 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:31,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 170 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:42:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-11-23 21:42:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 229. [2023-11-23 21:42:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 194 states have (on average 1.288659793814433) internal successors, (250), 194 states have internal predecessors, (250), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 21:42:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 314 transitions. [2023-11-23 21:42:31,688 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 314 transitions. Word has length 115 [2023-11-23 21:42:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:31,690 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 314 transitions. [2023-11-23 21:42:31,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 314 transitions. [2023-11-23 21:42:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-23 21:42:31,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:31,692 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:31,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 21:42:31,693 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:31,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2004087151, now seen corresponding path program 1 times [2023-11-23 21:42:31,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:31,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902537765] [2023-11-23 21:42:31,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:42:31,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:42:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:42:31,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:42:31,944 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:42:31,945 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 21:42:31,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 21:42:31,951 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:31,955 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:42:32,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-23 21:42:32,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-23 21:42:32,057 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-23 21:42:32,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-23 21:42:32,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-23 21:42:32,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-23 21:42:32,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-23 21:42:32,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-23 21:42:32,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-23 21:42:32,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-23 21:42:32,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-23 21:42:32,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:42:32 BoogieIcfgContainer [2023-11-23 21:42:32,089 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:42:32,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:42:32,090 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:42:32,090 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:42:32,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:42:17" (3/4) ... [2023-11-23 21:42:32,093 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 21:42:32,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:42:32,095 INFO L158 Benchmark]: Toolchain (without parser) took 16636.81ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 121.6MB in the beginning and 96.8MB in the end (delta: 24.8MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2023-11-23 21:42:32,095 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 138.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:42:32,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.31ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 107.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-23 21:42:32,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.96ms. Allocated memory is still 169.9MB. Free memory was 107.5MB in the beginning and 103.9MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:42:32,097 INFO L158 Benchmark]: Boogie Preprocessor took 72.82ms. Allocated memory is still 169.9MB. Free memory was 103.9MB in the beginning and 98.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 21:42:32,098 INFO L158 Benchmark]: RCFGBuilder took 865.28ms. Allocated memory is still 169.9MB. Free memory was 98.5MB in the beginning and 74.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 21:42:32,099 INFO L158 Benchmark]: TraceAbstraction took 15065.17ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 73.9MB in the beginning and 96.8MB in the end (delta: -22.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2023-11-23 21:42:32,099 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 218.1MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:42:32,101 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.40ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 138.7MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 523.31ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 107.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.96ms. Allocated memory is still 169.9MB. Free memory was 107.5MB in the beginning and 103.9MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.82ms. Allocated memory is still 169.9MB. Free memory was 103.9MB in the beginning and 98.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 865.28ms. Allocated memory is still 169.9MB. Free memory was 98.5MB in the beginning and 74.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15065.17ms. Allocated memory was 169.9MB in the beginning and 218.1MB in the end (delta: 48.2MB). Free memory was 73.9MB in the beginning and 96.8MB in the end (delta: -22.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 218.1MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 124, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of shiftRight at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateVariables() [L133] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=68, var_1_7=0] [L63] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=68, var_1_7=0] [L63] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L64] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=68, var_1_7=0] [L66] var_1_30 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L71] COND TRUE ! var_1_7 [L72] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L80] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L80] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L81] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=68, var_1_22=505, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=68, var_1_22=505, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=68, var_1_22=505, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=68, var_1_22=505, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=68, var_1_22=505, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=68, var_1_22=505, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=68, var_1_22=505, var_1_24=0, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1452 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1452 mSDsluCounter, 5094 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3588 mSDsCounter, 478 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2137 IncrementalHoareTripleChecker+Invalid, 2615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 478 mSolverCounterUnsat, 1506 mSDtfsCounter, 2137 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 570 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=9, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 1102 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1592 NumberOfCodeBlocks, 1592 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1464 ConstructedInterpolants, 0 QuantifiedInterpolants, 3829 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 6240/6240 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 [2023-11-23 21:42:32,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ --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 e0b92bdde1a6a66126d19d639f9e494a5579381be868a4b13fb2299a2d0086c0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:42:34,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:42:34,957 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-23 21:42:34,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:42:34,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:42:35,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:42:35,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:42:35,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:42:35,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 21:42:35,034 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 21:42:35,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:42:35,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:42:35,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:42:35,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:42:35,039 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:42:35,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:42:35,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:42:35,041 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:42:35,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:42:35,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:42:35,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:42:35,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:42:35,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:42:35,045 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:42:35,045 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 21:42:35,046 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 21:42:35,046 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:42:35,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:42:35,047 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:42:35,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:42:35,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:42:35,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:42:35,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:42:35,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:42:35,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:42:35,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:42:35,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:42:35,053 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 21:42:35,053 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 21:42:35,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:42:35,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:42:35,054 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:42:35,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:42:35,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:42:35,055 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 21:42:35,055 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_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/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_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ 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 -> e0b92bdde1a6a66126d19d639f9e494a5579381be868a4b13fb2299a2d0086c0 [2023-11-23 21:42:35,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:42:35,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:42:35,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:42:35,474 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:42:35,474 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:42:35,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i [2023-11-23 21:42:38,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:42:39,048 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:42:39,050 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i [2023-11-23 21:42:39,068 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/data/f95e12c79/fa14c8c88489457a8738ac7263814549/FLAGf707556cb [2023-11-23 21:42:39,090 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/data/f95e12c79/fa14c8c88489457a8738ac7263814549 [2023-11-23 21:42:39,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:42:39,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:42:39,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:42:39,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:42:39,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:42:39,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598271da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39, skipping insertion in model container [2023-11-23 21:42:39,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,148 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:42:39,336 WARN L240 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_8a819800-1bcb-48de-ab38-0b7d4609e754/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i[915,928] [2023-11-23 21:42:39,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:42:39,456 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:42:39,475 WARN L240 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_8a819800-1bcb-48de-ab38-0b7d4609e754/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i[915,928] [2023-11-23 21:42:39,542 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:42:39,575 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:42:39,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39 WrapperNode [2023-11-23 21:42:39,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:42:39,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:42:39,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:42:39,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:42:39,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,670 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2023-11-23 21:42:39,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:42:39,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:42:39,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:42:39,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:42:39,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,704 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,726 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 21:42:39,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:42:39,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:42:39,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:42:39,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:42:39,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (1/1) ... [2023-11-23 21:42:39,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:42:39,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:42:39,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:42:39,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:42:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:42:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-23 21:42:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 21:42:39,943 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 21:42:39,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:42:39,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:42:40,082 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:42:40,084 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:42:44,784 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:42:44,832 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:42:44,832 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 21:42:44,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:42:44 BoogieIcfgContainer [2023-11-23 21:42:44,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:42:44,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:42:44,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:42:44,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:42:44,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:42:39" (1/3) ... [2023-11-23 21:42:44,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaa539d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:42:44, skipping insertion in model container [2023-11-23 21:42:44,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:39" (2/3) ... [2023-11-23 21:42:44,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaa539d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:42:44, skipping insertion in model container [2023-11-23 21:42:44,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:42:44" (3/3) ... [2023-11-23 21:42:44,842 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-63.i [2023-11-23 21:42:44,861 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:42:44,862 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:42:44,912 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:42:44,919 INFO L357 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, mHoare=true, 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;@1d52100d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:42:44,919 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:42:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 21:42:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 21:42:44,938 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:44,938 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:44,939 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:44,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:44,945 INFO L85 PathProgramCache]: Analyzing trace with hash -593136738, now seen corresponding path program 1 times [2023-11-23 21:42:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:42:44,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809147433] [2023-11-23 21:42:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:44,960 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 [2023-11-23 21:42:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:42:44,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/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) [2023-11-23 21:42:44,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/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 [2023-11-23 21:42:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:45,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 21:42:45,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:42:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-11-23 21:42:45,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:42:45,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:42:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809147433] [2023-11-23 21:42:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809147433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:45,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:45,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:42:45,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680230282] [2023-11-23 21:42:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:45,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 21:42:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:42:45,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 21:42:45,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:42:45,627 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 21:42:47,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:42:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:47,810 INFO L93 Difference]: Finished difference Result 103 states and 174 transitions. [2023-11-23 21:42:47,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:42:47,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2023-11-23 21:42:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:47,848 INFO L225 Difference]: With dead ends: 103 [2023-11-23 21:42:47,848 INFO L226 Difference]: Without dead ends: 51 [2023-11-23 21:42:47,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:42:47,856 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:47,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2023-11-23 21:42:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-23 21:42:47,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-23 21:42:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 21:42:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2023-11-23 21:42:47,908 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 107 [2023-11-23 21:42:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:47,909 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2023-11-23 21:42:47,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 21:42:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2023-11-23 21:42:47,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 21:42:47,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:47,914 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:47,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-23 21:42:48,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/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 [2023-11-23 21:42:48,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:48,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash 32285522, now seen corresponding path program 1 times [2023-11-23 21:42:48,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:42:48,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113417559] [2023-11-23 21:42:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:48,134 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 [2023-11-23 21:42:48,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:42:48,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/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) [2023-11-23 21:42:48,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/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 [2023-11-23 21:42:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:48,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 21:42:48,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:42:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 21:42:48,720 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:42:48,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:42:48,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113417559] [2023-11-23 21:42:48,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113417559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:48,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:48,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:42:48,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354162167] [2023-11-23 21:42:48,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:48,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:42:48,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:42:48,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:42:48,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:42:48,726 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:51,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:42:53,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:42:55,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-23 21:42:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:55,268 INFO L93 Difference]: Finished difference Result 116 states and 170 transitions. [2023-11-23 21:42:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:42:55,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-11-23 21:42:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:55,272 INFO L225 Difference]: With dead ends: 116 [2023-11-23 21:42:55,272 INFO L226 Difference]: Without dead ends: 66 [2023-11-23 21:42:55,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:42:55,275 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:55,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 136 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2023-11-23 21:42:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-23 21:42:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2023-11-23 21:42:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 21:42:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2023-11-23 21:42:55,292 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 107 [2023-11-23 21:42:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:55,312 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2023-11-23 21:42:55,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 21:42:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2023-11-23 21:42:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 21:42:55,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:55,316 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:42:55,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-23 21:42:55,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/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 [2023-11-23 21:42:55,525 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:55,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:55,526 INFO L85 PathProgramCache]: Analyzing trace with hash 991515538, now seen corresponding path program 1 times [2023-11-23 21:42:55,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:42:55,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127931627] [2023-11-23 21:42:55,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:55,527 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 [2023-11-23 21:42:55,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:42:55,529 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/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) [2023-11-23 21:42:55,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a819800-1bcb-48de-ab38-0b7d4609e754/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-23 21:42:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:56,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-23 21:42:56,095 INFO L285 TraceCheckSpWp]: Computing forward predicates...