./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu --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 d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:59:28,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:59:28,215 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:59:28,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:59:28,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:59:28,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:59:28,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:59:28,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:59:28,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:59:28,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:59:28,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:59:28,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:59:28,284 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:59:28,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:59:28,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:59:28,287 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:59:28,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:59:28,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:59:28,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:59:28,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:59:28,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:59:28,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:59:28,293 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:59:28,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:59:28,294 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:59:28,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:59:28,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:59:28,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:59:28,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:59:28,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:59:28,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:59:28,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:59:28,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:59:28,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:59:28,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:59:28,300 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:59:28,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:59:28,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:59:28,300 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:59:28,301 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_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/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_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu 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 -> d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902 [2023-11-19 07:59:28,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:59:28,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:59:28,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:59:28,615 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:59:28,616 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:59:28,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-11-19 07:59:31,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:59:32,057 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:59:32,057 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-11-19 07:59:32,071 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/data/b5c7ac3ef/c5cdc24ec5e54095be201e859a4ddb68/FLAG7b6c6b6eb [2023-11-19 07:59:32,084 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/data/b5c7ac3ef/c5cdc24ec5e54095be201e859a4ddb68 [2023-11-19 07:59:32,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:59:32,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:59:32,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:32,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:59:32,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:59:32,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3584b05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32, skipping insertion in model container [2023-11-19 07:59:32,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,124 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:59:32,324 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_f4888b89-2686-4c5c-812a-3beaf29d9e9f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928] [2023-11-19 07:59:32,411 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:32,433 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:59:32,453 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_f4888b89-2686-4c5c-812a-3beaf29d9e9f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928] [2023-11-19 07:59:32,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:32,501 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:59:32,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32 WrapperNode [2023-11-19 07:59:32,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:32,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:32,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:59:32,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:59:32,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,567 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2023-11-19 07:59:32,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:32,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:59:32,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:59:32,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:59:32,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:59:32,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:59:32,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:59:32,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:59:32,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:59:32,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:32,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:59:32,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:59:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:59:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:59:32,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:59:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:59:32,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:59:32,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:59:32,838 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:59:32,842 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:59:33,146 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:59:33,156 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:59:33,156 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:59:33,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:33 BoogieIcfgContainer [2023-11-19 07:59:33,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:59:33,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:59:33,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:59:33,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:59:33,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:59:32" (1/3) ... [2023-11-19 07:59:33,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e256c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:59:33, skipping insertion in model container [2023-11-19 07:59:33,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (2/3) ... [2023-11-19 07:59:33,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e256c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:59:33, skipping insertion in model container [2023-11-19 07:59:33,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:33" (3/3) ... [2023-11-19 07:59:33,172 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-11-19 07:59:33,190 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:59:33,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:59:33,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:59:33,250 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;@dcbb68b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:59:33,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:59:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 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-19 07:59:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-19 07:59:33,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:33,270 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] [2023-11-19 07:59:33,271 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:33,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:33,277 INFO L85 PathProgramCache]: Analyzing trace with hash -260623924, now seen corresponding path program 1 times [2023-11-19 07:59:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:33,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891395298] [2023-11-19 07:59:33,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:33,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:59:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-19 07:59:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:59:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-19 07:59:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:59:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 07:59:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:59:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,853 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-19 07:59:33,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:33,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891395298] [2023-11-19 07:59:33,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891395298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:33,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:33,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:59:33,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049823750] [2023-11-19 07:59:33,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:33,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:59:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:33,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:59:33,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:59:33,912 INFO L87 Difference]: Start difference. First operand has 64 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-19 07:59:33,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:33,964 INFO L93 Difference]: Finished difference Result 125 states and 205 transitions. [2023-11-19 07:59:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:59:33,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (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 108 [2023-11-19 07:59:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:33,978 INFO L225 Difference]: With dead ends: 125 [2023-11-19 07:59:33,978 INFO L226 Difference]: Without dead ends: 60 [2023-11-19 07:59:33,984 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-19 07:59:33,989 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:33,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:59:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-19 07:59:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-19 07:59:34,054 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-19 07:59:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2023-11-19 07:59:34,063 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 108 [2023-11-19 07:59:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:34,065 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2023-11-19 07:59:34,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (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-19 07:59:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2023-11-19 07:59:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-19 07:59:34,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:34,072 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] [2023-11-19 07:59:34,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:59:34,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:34,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1126458940, now seen corresponding path program 1 times [2023-11-19 07:59:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:34,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512231998] [2023-11-19 07:59:34,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:59:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-19 07:59:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:59:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-19 07:59:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:59:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 07:59:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:59:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,205 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-19 07:59:35,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:35,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512231998] [2023-11-19 07:59:35,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512231998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:35,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:35,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:59:35,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517172364] [2023-11-19 07:59:35,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:35,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:59:35,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:35,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:59:35,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:35,211 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-19 07:59:35,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:35,455 INFO L93 Difference]: Finished difference Result 166 states and 241 transitions. [2023-11-19 07:59:35,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:59:35,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 108 [2023-11-19 07:59:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:35,459 INFO L225 Difference]: With dead ends: 166 [2023-11-19 07:59:35,459 INFO L226 Difference]: Without dead ends: 109 [2023-11-19 07:59:35,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:35,462 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 64 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:35,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 296 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:59:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-19 07:59:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2023-11-19 07:59:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 77 states have internal predecessors, (101), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:59:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2023-11-19 07:59:35,491 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 108 [2023-11-19 07:59:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:35,492 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2023-11-19 07:59:35,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-19 07:59:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2023-11-19 07:59:35,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-19 07:59:35,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:35,496 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] [2023-11-19 07:59:35,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:59:35,496 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:35,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:35,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1713264954, now seen corresponding path program 1 times [2023-11-19 07:59:35,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:35,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84108144] [2023-11-19 07:59:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:59:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-19 07:59:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:59:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-19 07:59:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:59:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 07:59:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:59:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,733 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-19 07:59:35,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:35,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84108144] [2023-11-19 07:59:35,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84108144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:35,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:35,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:59:35,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481490379] [2023-11-19 07:59:35,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:35,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:59:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:35,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:59:35,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:59:35,738 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (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-19 07:59:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:35,825 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2023-11-19 07:59:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:59:35,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (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 108 [2023-11-19 07:59:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:35,829 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:59:35,830 INFO L226 Difference]: Without dead ends: 111 [2023-11-19 07:59:35,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:59:35,833 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 5 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:35,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 216 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:59:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-19 07:59:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2023-11-19 07:59:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 79 states have internal predecessors, (103), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:59:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2023-11-19 07:59:35,856 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 108 [2023-11-19 07:59:35,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:35,857 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2023-11-19 07:59:35,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (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-19 07:59:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2023-11-19 07:59:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-19 07:59:35,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:35,860 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] [2023-11-19 07:59:35,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:59:35,860 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:35,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1672944269, now seen corresponding path program 1 times [2023-11-19 07:59:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:35,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764305082] [2023-11-19 07:59:35,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:35,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:59:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-19 07:59:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:59:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-19 07:59:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:59:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 07:59:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:59:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,031 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-19 07:59:36,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:36,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764305082] [2023-11-19 07:59:36,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764305082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:36,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:36,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:59:36,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713359075] [2023-11-19 07:59:36,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:36,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:59:36,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:36,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:59:36,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:36,034 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-19 07:59:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:36,183 INFO L93 Difference]: Finished difference Result 281 states and 404 transitions. [2023-11-19 07:59:36,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:59:36,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 109 [2023-11-19 07:59:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:36,187 INFO L225 Difference]: With dead ends: 281 [2023-11-19 07:59:36,187 INFO L226 Difference]: Without dead ends: 179 [2023-11-19 07:59:36,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:59:36,189 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 111 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:36,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 318 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:59:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-11-19 07:59:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 162. [2023-11-19 07:59:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:59:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 235 transitions. [2023-11-19 07:59:36,229 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 235 transitions. Word has length 109 [2023-11-19 07:59:36,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:36,230 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 235 transitions. [2023-11-19 07:59:36,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-19 07:59:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 235 transitions. [2023-11-19 07:59:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-19 07:59:36,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:36,232 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] [2023-11-19 07:59:36,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:59:36,233 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:36,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:36,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1610905777, now seen corresponding path program 1 times [2023-11-19 07:59:36,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:36,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897236812] [2023-11-19 07:59:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:59:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-19 07:59:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:59:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-19 07:59:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:59:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 07:59:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:59:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-19 07:59:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:36,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897236812] [2023-11-19 07:59:36,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897236812] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:59:36,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806971102] [2023-11-19 07:59:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:36,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:36,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:36,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:59:36,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:59:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-19 07:59:36,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2023-11-19 07:59:36,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:59:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-19 07:59:37,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806971102] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:59:37,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:59:37,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-19 07:59:37,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896760070] [2023-11-19 07:59:37,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:59:37,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:59:37,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:37,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:59:37,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:59:37,102 INFO L87 Difference]: Start difference. First operand 162 states and 235 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-19 07:59:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:37,690 INFO L93 Difference]: Finished difference Result 598 states and 846 transitions. [2023-11-19 07:59:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-19 07:59:37,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 109 [2023-11-19 07:59:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:37,695 INFO L225 Difference]: With dead ends: 598 [2023-11-19 07:59:37,695 INFO L226 Difference]: Without dead ends: 439 [2023-11-19 07:59:37,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2023-11-19 07:59:37,698 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 280 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:37,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 248 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:59:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-19 07:59:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 409. [2023-11-19 07:59:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 301 states have (on average 1.2624584717607974) internal successors, (380), 306 states have internal predecessors, (380), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-19 07:59:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 572 transitions. [2023-11-19 07:59:37,781 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 572 transitions. Word has length 109 [2023-11-19 07:59:37,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:37,782 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 572 transitions. [2023-11-19 07:59:37,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-19 07:59:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 572 transitions. [2023-11-19 07:59:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-19 07:59:37,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:37,784 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] [2023-11-19 07:59:37,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 07:59:37,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:37,998 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:37,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1718400783, now seen corresponding path program 1 times [2023-11-19 07:59:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:37,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110337606] [2023-11-19 07:59:37,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:37,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:59:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-19 07:59:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:59:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-19 07:59:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:59:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 07:59:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:59:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,151 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-19 07:59:38,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:38,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110337606] [2023-11-19 07:59:38,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110337606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:38,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:38,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:59:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749067779] [2023-11-19 07:59:38,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:38,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:59:38,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:38,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:59:38,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:59:38,154 INFO L87 Difference]: Start difference. First operand 409 states and 572 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-19 07:59:38,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:38,264 INFO L93 Difference]: Finished difference Result 821 states and 1148 transitions. [2023-11-19 07:59:38,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:59:38,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 109 [2023-11-19 07:59:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:38,268 INFO L225 Difference]: With dead ends: 821 [2023-11-19 07:59:38,269 INFO L226 Difference]: Without dead ends: 415 [2023-11-19 07:59:38,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-19 07:59:38,271 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 89 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:38,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 249 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:59:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-11-19 07:59:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 409. [2023-11-19 07:59:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 301 states have (on average 1.2425249169435215) internal successors, (374), 306 states have internal predecessors, (374), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-19 07:59:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 566 transitions. [2023-11-19 07:59:38,347 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 566 transitions. Word has length 109 [2023-11-19 07:59:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:38,356 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 566 transitions. [2023-11-19 07:59:38,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-19 07:59:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 566 transitions. [2023-11-19 07:59:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-19 07:59:38,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:38,358 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] [2023-11-19 07:59:38,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:59:38,359 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:38,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:38,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1975540332, now seen corresponding path program 1 times [2023-11-19 07:59:38,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:38,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393573574] [2023-11-19 07:59:38,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:38,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:59:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-19 07:59:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:59:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-19 07:59:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:59:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 07:59:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:59:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,151 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-19 07:59:50,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393573574] [2023-11-19 07:59:50,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393573574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:50,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-19 07:59:50,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921035345] [2023-11-19 07:59:50,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:50,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:59:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:50,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:59:50,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:59:50,159 INFO L87 Difference]: Start difference. First operand 409 states and 566 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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-19 07:59:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:53,843 INFO L93 Difference]: Finished difference Result 581 states and 781 transitions. [2023-11-19 07:59:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-19 07:59:53,845 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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 111 [2023-11-19 07:59:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:53,851 INFO L225 Difference]: With dead ends: 581 [2023-11-19 07:59:53,851 INFO L226 Difference]: Without dead ends: 579 [2023-11-19 07:59:53,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=417, Invalid=1305, Unknown=0, NotChecked=0, Total=1722 [2023-11-19 07:59:53,854 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 325 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:53,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 601 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-19 07:59:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2023-11-19 07:59:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 440. [2023-11-19 07:59:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 324 states have (on average 1.2314814814814814) internal successors, (399), 330 states have internal predecessors, (399), 102 states have call successors, (102), 13 states have call predecessors, (102), 13 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2023-11-19 07:59:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 603 transitions. [2023-11-19 07:59:53,947 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 603 transitions. Word has length 111 [2023-11-19 07:59:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:53,948 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 603 transitions. [2023-11-19 07:59:53,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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-19 07:59:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 603 transitions. [2023-11-19 07:59:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-19 07:59:53,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:53,951 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] [2023-11-19 07:59:53,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:59:53,952 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:53,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash 87370906, now seen corresponding path program 1 times [2023-11-19 07:59:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:53,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711564050] [2023-11-19 07:59:53,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:53,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:59:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-19 07:59:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:59:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-19 07:59:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:59:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 07:59:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:59:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,365 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-19 07:59:54,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:54,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711564050] [2023-11-19 07:59:54,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711564050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:54,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:54,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:59:54,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945657916] [2023-11-19 07:59:54,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:54,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:59:54,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:54,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:59:54,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:59:54,369 INFO L87 Difference]: Start difference. First operand 440 states and 603 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-19 07:59:54,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:54,680 INFO L93 Difference]: Finished difference Result 1217 states and 1666 transitions. [2023-11-19 07:59:54,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:59:54,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 111 [2023-11-19 07:59:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:54,691 INFO L225 Difference]: With dead ends: 1217 [2023-11-19 07:59:54,692 INFO L226 Difference]: Without dead ends: 792 [2023-11-19 07:59:54,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-19 07:59:54,696 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 91 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:54,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 287 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:59:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2023-11-19 07:59:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 544. [2023-11-19 07:59:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 414 states have (on average 1.2053140096618358) internal successors, (499), 421 states have internal predecessors, (499), 114 states have call successors, (114), 15 states have call predecessors, (114), 15 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-19 07:59:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 727 transitions. [2023-11-19 07:59:54,822 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 727 transitions. Word has length 111 [2023-11-19 07:59:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:54,822 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 727 transitions. [2023-11-19 07:59:54,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-19 07:59:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 727 transitions. [2023-11-19 07:59:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-19 07:59:54,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:54,826 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] [2023-11-19 07:59:54,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:59:54,826 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:54,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash -759474786, now seen corresponding path program 1 times [2023-11-19 07:59:54,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:54,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908923377] [2023-11-19 07:59:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:59:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-19 07:59:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:59:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-19 07:59:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:59:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 07:59:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:59:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:54,936 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-19 07:59:54,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:54,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908923377] [2023-11-19 07:59:54,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908923377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:54,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:54,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:59:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350612006] [2023-11-19 07:59:54,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:54,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:59:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:54,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:59:54,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:59:54,941 INFO L87 Difference]: Start difference. First operand 544 states and 727 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-19 07:59:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:55,152 INFO L93 Difference]: Finished difference Result 1384 states and 1848 transitions. [2023-11-19 07:59:55,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:59:55,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 112 [2023-11-19 07:59:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:55,162 INFO L225 Difference]: With dead ends: 1384 [2023-11-19 07:59:55,162 INFO L226 Difference]: Without dead ends: 855 [2023-11-19 07:59:55,164 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-19 07:59:55,167 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 64 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:55,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 156 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:59:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2023-11-19 07:59:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 528. [2023-11-19 07:59:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 398 states have (on average 1.1582914572864322) internal successors, (461), 405 states have internal predecessors, (461), 114 states have call successors, (114), 15 states have call predecessors, (114), 15 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-19 07:59:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 689 transitions. [2023-11-19 07:59:55,384 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 689 transitions. Word has length 112 [2023-11-19 07:59:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:55,385 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 689 transitions. [2023-11-19 07:59:55,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-19 07:59:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 689 transitions. [2023-11-19 07:59:55,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-19 07:59:55,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:55,388 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] [2023-11-19 07:59:55,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:59:55,389 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:55,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:55,390 INFO L85 PathProgramCache]: Analyzing trace with hash -567231656, now seen corresponding path program 1 times [2023-11-19 07:59:55,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:55,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636298479] [2023-11-19 07:59:55,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:55,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:59:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:59:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:59:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:59:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:59:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:59:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-19 07:59:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:59:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:59:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 07:59:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-19 07:59:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 07:59:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 07:59:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:59:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:55,607 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-19 07:59:55,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:55,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636298479] [2023-11-19 07:59:55,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636298479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:55,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:55,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:59:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126237547] [2023-11-19 07:59:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:55,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:59:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:55,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:59:55,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:55,611 INFO L87 Difference]: Start difference. First operand 528 states and 689 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-19 07:59:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:55,953 INFO L93 Difference]: Finished difference Result 1126 states and 1485 transitions. [2023-11-19 07:59:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:59:55,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 112 [2023-11-19 07:59:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:55,961 INFO L225 Difference]: With dead ends: 1126 [2023-11-19 07:59:55,961 INFO L226 Difference]: Without dead ends: 800 [2023-11-19 07:59:55,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-19 07:59:55,963 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 67 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:55,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 240 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:59:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2023-11-19 07:59:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 528. [2023-11-19 07:59:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 398 states have (on average 1.1331658291457287) internal successors, (451), 405 states have internal predecessors, (451), 114 states have call successors, (114), 15 states have call predecessors, (114), 15 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-19 07:59:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 679 transitions. [2023-11-19 07:59:56,078 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 679 transitions. Word has length 112 [2023-11-19 07:59:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:56,079 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 679 transitions. [2023-11-19 07:59:56,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-19 07:59:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 679 transitions. [2023-11-19 07:59:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-19 07:59:56,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:56,082 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] [2023-11-19 07:59:56,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:59:56,083 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:56,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1928502356, now seen corresponding path program 1 times [2023-11-19 07:59:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:56,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736588680] [2023-11-19 07:59:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:56,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:00:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:00:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:00:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 08:00:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:00:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:00:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 08:00:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 08:00:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-19 08:00:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 08:00:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 08:00:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-19 08:00:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-19 08:00:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-19 08:00:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-19 08:00:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 08:00:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:00,911 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-19 08:00:00,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:00,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736588680] [2023-11-19 08:00:00,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736588680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:00,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:00,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-19 08:00:00,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873971354] [2023-11-19 08:00:00,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:00,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-19 08:00:00,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:00,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-19 08:00:00,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-11-19 08:00:00,914 INFO L87 Difference]: Start difference. First operand 528 states and 679 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-19 08:00:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:04,192 INFO L93 Difference]: Finished difference Result 1174 states and 1495 transitions. [2023-11-19 08:00:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-19 08:00:04,194 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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 112 [2023-11-19 08:00:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:04,200 INFO L225 Difference]: With dead ends: 1174 [2023-11-19 08:00:04,201 INFO L226 Difference]: Without dead ends: 661 [2023-11-19 08:00:04,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2023-11-19 08:00:04,204 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 207 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:04,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 673 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-19 08:00:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2023-11-19 08:00:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 532. [2023-11-19 08:00:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 402 states have (on average 1.1293532338308458) internal successors, (454), 409 states have internal predecessors, (454), 114 states have call successors, (114), 15 states have call predecessors, (114), 15 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-19 08:00:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 682 transitions. [2023-11-19 08:00:04,299 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 682 transitions. Word has length 112 [2023-11-19 08:00:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:04,300 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 682 transitions. [2023-11-19 08:00:04,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-19 08:00:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 682 transitions. [2023-11-19 08:00:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-19 08:00:04,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:04,303 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-19 08:00:04,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:00:04,304 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:00:04,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:04,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1516767649, now seen corresponding path program 1 times [2023-11-19 08:00:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:04,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695313921] [2023-11-19 08:00:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:04,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:04,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:04,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:04,491 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:00:04,493 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 08:00:04,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 08:00:04,501 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:04,507 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:00:04,623 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-19 08:00:04,629 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated [2023-11-19 08:00:04,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:00:04 BoogieIcfgContainer [2023-11-19 08:00:04,658 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:00:04,659 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:00:04,659 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:00:04,659 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:00:04,660 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:33" (3/4) ... [2023-11-19 08:00:04,663 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 08:00:04,664 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:00:04,665 INFO L158 Benchmark]: Toolchain (without parser) took 32576.41ms. Allocated memory was 167.8MB in the beginning and 509.6MB in the end (delta: 341.8MB). Free memory was 127.9MB in the beginning and 391.2MB in the end (delta: -263.3MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2023-11-19 08:00:04,665 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:00:04,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.23ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 115.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 08:00:04,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.16ms. Allocated memory is still 167.8MB. Free memory was 114.9MB in the beginning and 112.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:00:04,667 INFO L158 Benchmark]: Boogie Preprocessor took 40.60ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:00:04,668 INFO L158 Benchmark]: RCFGBuilder took 541.75ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 94.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-19 08:00:04,668 INFO L158 Benchmark]: TraceAbstraction took 31493.98ms. Allocated memory was 167.8MB in the beginning and 509.6MB in the end (delta: 341.8MB). Free memory was 93.9MB in the beginning and 392.3MB in the end (delta: -298.3MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2023-11-19 08:00:04,669 INFO L158 Benchmark]: Witness Printer took 5.46ms. Allocated memory is still 509.6MB. Free memory was 392.3MB in the beginning and 391.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:00:04,672 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.23ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 115.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.16ms. Allocated memory is still 167.8MB. Free memory was 114.9MB in the beginning and 112.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.60ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 541.75ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 94.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31493.98ms. Allocated memory was 167.8MB in the beginning and 509.6MB in the end (delta: 341.8MB). Free memory was 93.9MB in the beginning and 392.3MB in the end (delta: -298.3MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * Witness Printer took 5.46ms. Allocated memory is still 509.6MB. Free memory was 392.3MB in the beginning and 391.2MB in the end (delta: 1.0MB). 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~short16 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 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 4.5; [L25] double var_1_4 = 2.5; [L26] double var_1_5 = 0.0; [L27] double var_1_6 = 999999999999.3; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = -64; [L30] signed char var_1_12 = 5; [L31] signed char var_1_13 = 50; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_15 = 0; [L34] unsigned char var_1_16 = 0; [L35] unsigned char var_1_17 = 0; [L36] signed char last_1_var_1_7 = -128; VAL [isInitial=0, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L107] isInitial = 1 [L108] FCALL initially() [L109] int k_loop; [L110] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L110] COND TRUE k_loop < 1 [L111] CALL updateLastVariables() [L100] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L75] var_1_3 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L76] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L78] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L79] var_1_5 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=9999999999993/10, var_1_7=-128] [L80] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=9999999999993/10, var_1_7=-128] [L81] var_1_6 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L82] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L83] var_1_11 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L112] RET updateVariables() [L113] CALL step() [L40] signed long int stepLocal_1 = ((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7; VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=124, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L41] COND FALSE !(last_1_var_1_7 <= stepLocal_1) [L44] var_1_12 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L46] unsigned char stepLocal_3 = var_1_2; [L47] unsigned long int stepLocal_2 = (((25u) > (var_1_12)) ? (25u) : (var_1_12)); VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=124, stepLocal_3=0, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L48] COND TRUE stepLocal_3 || var_1_15 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=124, stepLocal_3=0, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L49] COND TRUE stepLocal_2 <= var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=124, stepLocal_3=0, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L50] COND FALSE !(\read(var_1_2)) [L53] var_1_14 = var_1_17 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=124, stepLocal_3=0, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L59] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=124, stepLocal_3=0, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L59] signed long int stepLocal_0 = var_1_12 ^ var_1_12; [L60] COND TRUE ((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != stepLocal_0 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=124, stepLocal_3=0, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=-128] [L61] COND TRUE \read(var_1_14) [L62] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=124, stepLocal_3=0, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=124] [L67] COND TRUE \read(var_1_14) [L68] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=124, stepLocal_3=0, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000005, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=124] [L113] RET step() [L114] CALL, EXPR property() [L103] EXPR (var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11))) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000005, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=124] [L103-L104] return (((var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11)))) && ((last_1_var_1_7 <= (((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7)) ? (var_1_12 == ((signed char) (var_1_13 - 1))) : (var_1_12 == ((signed char) var_1_11)))) && ((var_1_2 || var_1_15) ? ((((((25u) > (var_1_12)) ? (25u) : (var_1_12))) <= var_1_12) ? (var_1_2 ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_17))) : 1) : (var_1_14 == ((unsigned char) var_1_16))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000005, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=124] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=124, var_1_12=124, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000005, var_1_2=0, var_1_3=1000000000005, var_1_4=1000000000007, var_1_5=1000000000004, var_1_6=1000000000006, var_1_7=124] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.3s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1329 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1303 mSDsluCounter, 3375 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2281 mSDsCounter, 354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1917 IncrementalHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 354 mSolverCounterUnsat, 1094 mSDtfsCounter, 1917 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 732 GetRequests, 612 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=8, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 1180 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 1431 NumberOfCodeBlocks, 1431 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1414 ConstructedInterpolants, 0 QuantifiedInterpolants, 5146 SizeOfPredicates, 4 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 6222/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-19 08:00:04,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu --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 d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:00:07,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:00:08,177 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-19 08:00:08,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:00:08,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:00:08,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:00:08,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:00:08,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:00:08,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:00:08,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:00:08,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:00:08,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:00:08,258 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:00:08,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:00:08,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:00:08,262 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:00:08,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:00:08,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:00:08,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:00:08,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:00:08,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:00:08,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:00:08,268 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 08:00:08,269 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 08:00:08,270 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:00:08,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:00:08,271 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:00:08,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:00:08,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:00:08,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:00:08,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:00:08,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:00:08,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:00:08,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:00:08,277 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 08:00:08,278 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 08:00:08,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:00:08,279 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:00:08,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:00:08,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:00:08,281 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 08:00:08,281 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:00:08,282 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_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/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_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu 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 -> d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902 [2023-11-19 08:00:08,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:00:08,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:00:08,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:00:08,848 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:00:08,848 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:00:08,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-11-19 08:00:12,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:00:12,786 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:00:12,788 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-11-19 08:00:12,799 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/data/a28cb8d7f/66cd1615d9014a21a2829aacd7c402c6/FLAG9d621e3fc [2023-11-19 08:00:12,821 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/data/a28cb8d7f/66cd1615d9014a21a2829aacd7c402c6 [2023-11-19 08:00:12,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:00:12,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:00:12,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:12,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:00:12,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:00:12,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:12" (1/1) ... [2023-11-19 08:00:12,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a516b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:12, skipping insertion in model container [2023-11-19 08:00:12,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:12" (1/1) ... [2023-11-19 08:00:12,893 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:00:13,109 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_f4888b89-2686-4c5c-812a-3beaf29d9e9f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928] [2023-11-19 08:00:13,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:13,247 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:00:13,267 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_f4888b89-2686-4c5c-812a-3beaf29d9e9f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928] [2023-11-19 08:00:13,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:13,358 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:00:13,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13 WrapperNode [2023-11-19 08:00:13,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:13,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:13,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:00:13,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:00:13,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13" (1/1) ... [2023-11-19 08:00:13,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13" (1/1) ... [2023-11-19 08:00:13,450 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2023-11-19 08:00:13,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:13,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:00:13,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:00:13,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:00:13,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13" (1/1) ... [2023-11-19 08:00:13,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13" (1/1) ... [2023-11-19 08:00:13,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13" (1/1) ... [2023-11-19 08:00:13,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13" (1/1) ... [2023-11-19 08:00:13,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13" (1/1) ... [2023-11-19 08:00:13,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13" (1/1) ... [2023-11-19 08:00:13,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13" (1/1) ... [2023-11-19 08:00:13,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13" (1/1) ... [2023-11-19 08:00:13,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:00:13,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:00:13,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:00:13,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:00:13,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:13" (1/1) ... [2023-11-19 08:00:13,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:00:13,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:00:13,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:00:13,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4888b89-2686-4c5c-812a-3beaf29d9e9f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:00:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:00:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 08:00:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 08:00:13,625 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 08:00:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:00:13,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:00:13,815 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:00:13,845 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation