./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.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_60a60217-c595-4dfd-8717-3f891a65662c/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/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_60a60217-c595-4dfd-8717-3f891a65662c/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/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_60a60217-c595-4dfd-8717-3f891a65662c/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 0f5f56644b3db98e889fbbdbdbf88f43e5157acb1dba68661da1592e817fffbd --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:37:49,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:37:49,875 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:37:49,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:37:49,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:37:49,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:37:49,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:37:49,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:37:49,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:37:49,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:37:49,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:37:49,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:37:49,918 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:37:49,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:37:49,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:37:49,920 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:37:49,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:37:49,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:37:49,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:37:49,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:37:49,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:37:49,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:37:49,925 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:37:49,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:37:49,926 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:37:49,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:37:49,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:37:49,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:37:49,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:37:49,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:37:49,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:37:49,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:37:49,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:37:49,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:37:49,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:37:49,931 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:37:49,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:37:49,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:37:49,932 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:37:49,933 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_60a60217-c595-4dfd-8717-3f891a65662c/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_60a60217-c595-4dfd-8717-3f891a65662c/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 -> 0f5f56644b3db98e889fbbdbdbf88f43e5157acb1dba68661da1592e817fffbd [2023-11-19 07:37:50,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:37:50,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:37:50,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:37:50,267 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:37:50,268 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:37:50,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i [2023-11-19 07:37:53,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:37:53,878 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:37:53,879 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i [2023-11-19 07:37:53,889 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/bin/uautomizer-verify-uCwYo4JHxu/data/3b4863b84/dc6ff7ea8ad84548a61d92ef284d2ffb/FLAG7deb4cfab [2023-11-19 07:37:53,904 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/bin/uautomizer-verify-uCwYo4JHxu/data/3b4863b84/dc6ff7ea8ad84548a61d92ef284d2ffb [2023-11-19 07:37:53,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:37:53,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:37:53,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:37:53,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:37:53,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:37:53,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:53" (1/1) ... [2023-11-19 07:37:53,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@346be14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53, skipping insertion in model container [2023-11-19 07:37:53,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:53" (1/1) ... [2023-11-19 07:37:53,953 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:37:54,156 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_60a60217-c595-4dfd-8717-3f891a65662c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i[915,928] [2023-11-19 07:37:54,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:37:54,215 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:37:54,228 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_60a60217-c595-4dfd-8717-3f891a65662c/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-82.i[915,928] [2023-11-19 07:37:54,264 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:37:54,287 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:37:54,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54 WrapperNode [2023-11-19 07:37:54,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:37:54,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:37:54,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:37:54,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:37:54,298 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:37:54" (1/1) ... [2023-11-19 07:37:54,326 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:37:54" (1/1) ... [2023-11-19 07:37:54,373 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2023-11-19 07:37:54,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:37:54,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:37:54,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:37:54,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:37:54,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2023-11-19 07:37:54,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2023-11-19 07:37:54,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2023-11-19 07:37:54,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2023-11-19 07:37:54,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2023-11-19 07:37:54,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2023-11-19 07:37:54,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2023-11-19 07:37:54,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2023-11-19 07:37:54,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:37:54,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:37:54,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:37:54,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:37:54,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (1/1) ... [2023-11-19 07:37:54,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:37:54,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:54,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/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:37:54,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/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:37:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:37:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:37:54,559 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:37:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:37:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:37:54,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:37:54,674 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:37:54,678 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:37:55,041 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:37:55,050 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:37:55,050 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:37:55,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:55 BoogieIcfgContainer [2023-11-19 07:37:55,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:37:55,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:37:55,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:37:55,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:37:55,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:37:53" (1/3) ... [2023-11-19 07:37:55,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291b66f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:55, skipping insertion in model container [2023-11-19 07:37:55,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:54" (2/3) ... [2023-11-19 07:37:55,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291b66f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:55, skipping insertion in model container [2023-11-19 07:37:55,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:55" (3/3) ... [2023-11-19 07:37:55,068 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-82.i [2023-11-19 07:37:55,088 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:37:55,088 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:37:55,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:37:55,149 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;@23d78fbb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:37:55,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:37:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-19 07:37:55,163 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:55,164 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:55,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash -865337059, now seen corresponding path program 1 times [2023-11-19 07:37:55,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61137062] [2023-11-19 07:37:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:55,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:37:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:37:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:37:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:37:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:37:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:37:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:55,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:55,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61137062] [2023-11-19 07:37:55,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61137062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:55,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:55,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:37:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473477698] [2023-11-19 07:37:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:55,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:37:55,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:55,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:37:55,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:37:55,637 INFO L87 Difference]: Start difference. First operand has 43 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:37:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:55,679 INFO L93 Difference]: Finished difference Result 77 states and 120 transitions. [2023-11-19 07:37:55,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:37:55,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2023-11-19 07:37:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:55,692 INFO L225 Difference]: With dead ends: 77 [2023-11-19 07:37:55,692 INFO L226 Difference]: Without dead ends: 37 [2023-11-19 07:37:55,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:37:55,703 INFO L413 NwaCegarLoop]: 49 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, 49 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:37:55,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-19 07:37:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-19 07:37:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2023-11-19 07:37:55,769 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 50 [2023-11-19 07:37:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:55,770 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2023-11-19 07:37:55,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:37:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2023-11-19 07:37:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-19 07:37:55,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:55,776 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:37:55,777 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:55,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:55,780 INFO L85 PathProgramCache]: Analyzing trace with hash -257835239, now seen corresponding path program 1 times [2023-11-19 07:37:55,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:55,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821111855] [2023-11-19 07:37:55,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:37:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:56,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:37:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:37:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:56,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:37:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:56,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:37:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:56,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:37:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:56,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:56,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821111855] [2023-11-19 07:37:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821111855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:56,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:56,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597334975] [2023-11-19 07:37:56,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:56,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:56,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:56,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:56,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:56,369 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:37:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:56,508 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2023-11-19 07:37:56,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:37:56,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2023-11-19 07:37:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:56,514 INFO L225 Difference]: With dead ends: 87 [2023-11-19 07:37:56,514 INFO L226 Difference]: Without dead ends: 53 [2023-11-19 07:37:56,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:37:56,524 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:56,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 162 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-19 07:37:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2023-11-19 07:37:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:37:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-11-19 07:37:56,546 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 50 [2023-11-19 07:37:56,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:56,548 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-11-19 07:37:56,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:37:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2023-11-19 07:37:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-19 07:37:56,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:56,553 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:56,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:37:56,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:56,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:56,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1410418132, now seen corresponding path program 1 times [2023-11-19 07:37:56,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:56,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865846142] [2023-11-19 07:37:56,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:56,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:57,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:37:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:37:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:37:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:57,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:37:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:57,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:37:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:57,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:37:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:57,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:57,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865846142] [2023-11-19 07:37:57,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865846142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:37:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494335189] [2023-11-19 07:37:57,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:57,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:37:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:57,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:37:57,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:37:57,467 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:37:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:57,859 INFO L93 Difference]: Finished difference Result 125 states and 168 transitions. [2023-11-19 07:37:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:37:57,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2023-11-19 07:37:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:57,862 INFO L225 Difference]: With dead ends: 125 [2023-11-19 07:37:57,862 INFO L226 Difference]: Without dead ends: 123 [2023-11-19 07:37:57,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:37:57,864 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 84 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:57,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 339 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:37:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-19 07:37:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2023-11-19 07:37:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 66 states have internal predecessors, (82), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-19 07:37:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2023-11-19 07:37:57,885 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 52 [2023-11-19 07:37:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:57,886 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2023-11-19 07:37:57,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:37:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2023-11-19 07:37:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-19 07:37:57,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:57,888 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:57,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:37:57,889 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:57,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1668583570, now seen corresponding path program 1 times [2023-11-19 07:37:57,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:57,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750417131] [2023-11-19 07:37:57,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:57,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:37:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:37:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:37:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:37:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:37:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:37:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:58,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:58,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750417131] [2023-11-19 07:37:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750417131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:58,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:37:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125443010] [2023-11-19 07:37:58,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:58,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:37:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:58,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:37:58,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:58,258 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:37:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:58,481 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2023-11-19 07:37:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:37:58,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2023-11-19 07:37:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:58,484 INFO L225 Difference]: With dead ends: 199 [2023-11-19 07:37:58,484 INFO L226 Difference]: Without dead ends: 124 [2023-11-19 07:37:58,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:37:58,487 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 46 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:58,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 178 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-19 07:37:58,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 96. [2023-11-19 07:37:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 77 states have internal predecessors, (93), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:37:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2023-11-19 07:37:58,506 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 52 [2023-11-19 07:37:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:58,506 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2023-11-19 07:37:58,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:37:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2023-11-19 07:37:58,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-19 07:37:58,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:58,508 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:58,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:37:58,508 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:58,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash -314811849, now seen corresponding path program 1 times [2023-11-19 07:37:58,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:58,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253964280] [2023-11-19 07:37:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:37:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:37:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:37:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:37:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:37:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:37:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-19 07:37:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:58,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253964280] [2023-11-19 07:37:58,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253964280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:58,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:58,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977131659] [2023-11-19 07:37:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:58,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:58,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:58,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:58,822 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:37:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:58,925 INFO L93 Difference]: Finished difference Result 170 states and 221 transitions. [2023-11-19 07:37:58,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:58,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2023-11-19 07:37:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:58,927 INFO L225 Difference]: With dead ends: 170 [2023-11-19 07:37:58,928 INFO L226 Difference]: Without dead ends: 95 [2023-11-19 07:37:58,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:37:58,934 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 38 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:58,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 105 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-19 07:37:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2023-11-19 07:37:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-19 07:37:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2023-11-19 07:37:58,974 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 53 [2023-11-19 07:37:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:58,975 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2023-11-19 07:37:58,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:37:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2023-11-19 07:37:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-19 07:37:58,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:58,977 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:58,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:37:58,978 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:58,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1837010626, now seen corresponding path program 1 times [2023-11-19 07:37:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:58,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515723881] [2023-11-19 07:37:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:37:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:37:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:37:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:37:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:37:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:37:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-19 07:37:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:37:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:37:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:37:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:37:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-19 07:37:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2023-11-19 07:37:59,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:59,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515723881] [2023-11-19 07:37:59,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515723881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:59,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:59,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:37:59,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666650354] [2023-11-19 07:37:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:59,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:37:59,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:59,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:37:59,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:37:59,724 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:38:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:00,033 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2023-11-19 07:38:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:38:00,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 101 [2023-11-19 07:38:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:00,037 INFO L225 Difference]: With dead ends: 139 [2023-11-19 07:38:00,037 INFO L226 Difference]: Without dead ends: 137 [2023-11-19 07:38:00,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:38:00,039 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:00,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 394 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:38:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-19 07:38:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 74. [2023-11-19 07:38:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:38:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2023-11-19 07:38:00,057 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 101 [2023-11-19 07:38:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:00,058 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2023-11-19 07:38:00,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:38:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2023-11-19 07:38:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-19 07:38:00,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:00,060 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:00,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:38:00,061 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:00,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2094111757, now seen corresponding path program 1 times [2023-11-19 07:38:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:00,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566130836] [2023-11-19 07:38:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:00,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:38:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:38:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:38:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:38:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:38:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-19 07:38:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:38:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:38:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:38:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:38:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-19 07:38:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2023-11-19 07:38:00,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:00,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566130836] [2023-11-19 07:38:00,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566130836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:00,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:00,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:00,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616424131] [2023-11-19 07:38:00,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:00,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:38:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:38:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:00,498 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:38:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:00,566 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2023-11-19 07:38:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:38:00,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 102 [2023-11-19 07:38:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:00,568 INFO L225 Difference]: With dead ends: 135 [2023-11-19 07:38:00,568 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 07:38:00,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:00,570 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 27 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:00,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 145 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 07:38:00,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 07:38:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:38:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 07:38:00,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2023-11-19 07:38:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:00,573 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:38:00,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-19 07:38:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:38:00,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 07:38:00,577 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:38:00,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:38:00,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 07:38:00,807 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-19 07:38:00,807 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-19 07:38:00,808 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-19 07:38:00,808 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 78 89) no Hoare annotation was computed. [2023-11-19 07:38:00,808 INFO L899 garLoopResultBuilder]: For program point L69(lines 59 70) no Hoare annotation was computed. [2023-11-19 07:38:00,810 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (<= ~var_1_5~0 255)) (.cse1 (<= 0 ~var_1_5~0))) (or (= ~var_1_9~0 ~var_1_5~0) (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) .cse0 .cse1) (and .cse0 .cse1 (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))))) [2023-11-19 07:38:00,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 07:38:00,811 INFO L895 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (let ((.cse0 (<= ~var_1_5~0 255)) (.cse1 (<= 0 ~var_1_5~0))) (or (= ~var_1_9~0 ~var_1_5~0) (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) .cse0 .cse1) (and .cse0 .cse1 (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))))) [2023-11-19 07:38:00,811 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-11-19 07:38:00,811 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-11-19 07:38:00,811 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-19 07:38:00,811 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 07:38:00,812 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 73) no Hoare annotation was computed. [2023-11-19 07:38:00,812 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 31) no Hoare annotation was computed. [2023-11-19 07:38:00,812 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-11-19 07:38:00,813 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (<= ~var_1_5~0 255)) (.cse1 (<= 0 ~var_1_5~0))) (or (= ~var_1_9~0 ~var_1_5~0) (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) .cse0 .cse1) (and .cse0 .cse1 (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))))) [2023-11-19 07:38:00,813 INFO L899 garLoopResultBuilder]: For program point L64-1(line 64) no Hoare annotation was computed. [2023-11-19 07:38:00,815 INFO L895 garLoopResultBuilder]: At program point L81-2(lines 81 87) the Hoare annotation is: (let ((.cse0 (<= ~var_1_5~0 255)) (.cse1 (<= 0 ~var_1_5~0))) (or (= ~var_1_9~0 ~var_1_5~0) (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) .cse0 .cse1) (and .cse0 .cse1 (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))))) [2023-11-19 07:38:00,815 INFO L899 garLoopResultBuilder]: For program point L81-3(lines 81 87) no Hoare annotation was computed. [2023-11-19 07:38:00,815 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-11-19 07:38:00,816 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 58) no Hoare annotation was computed. [2023-11-19 07:38:00,816 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 07:38:00,816 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-19 07:38:00,816 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2023-11-19 07:38:00,817 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 74 77) no Hoare annotation was computed. [2023-11-19 07:38:00,817 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse0 (<= ~var_1_5~0 255)) (.cse1 (<= 0 ~var_1_5~0))) (or (= ~var_1_9~0 ~var_1_5~0) (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) .cse0 .cse1) (and .cse0 .cse1 (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))))) [2023-11-19 07:38:00,817 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-11-19 07:38:00,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 07:38:00,818 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-19 07:38:00,818 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2023-11-19 07:38:00,819 INFO L899 garLoopResultBuilder]: For program point L75-3(line 75) no Hoare annotation was computed. [2023-11-19 07:38:00,819 INFO L899 garLoopResultBuilder]: For program point L75-5(line 75) no Hoare annotation was computed. [2023-11-19 07:38:00,819 INFO L899 garLoopResultBuilder]: For program point L75-7(line 75) no Hoare annotation was computed. [2023-11-19 07:38:00,819 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-11-19 07:38:00,820 INFO L899 garLoopResultBuilder]: For program point L34-2(line 34) no Hoare annotation was computed. [2023-11-19 07:38:00,821 INFO L899 garLoopResultBuilder]: For program point L34-4(lines 34 38) no Hoare annotation was computed. [2023-11-19 07:38:00,821 INFO L899 garLoopResultBuilder]: For program point L34-6(lines 32 58) no Hoare annotation was computed. [2023-11-19 07:38:00,821 INFO L902 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: true [2023-11-19 07:38:00,822 INFO L902 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: true [2023-11-19 07:38:00,822 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-19 07:38:00,822 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-19 07:38:00,822 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-19 07:38:00,822 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-19 07:38:00,826 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:38:00,829 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:38:00,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:38:00 BoogieIcfgContainer [2023-11-19 07:38:00,847 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:38:00,848 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:38:00,848 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:38:00,849 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:38:00,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:55" (3/4) ... [2023-11-19 07:38:00,853 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 07:38:00,858 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-19 07:38:00,868 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-19 07:38:00,869 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-19 07:38:00,870 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 07:38:00,870 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 07:38:01,024 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:38:01,025 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 07:38:01,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:38:01,026 INFO L158 Benchmark]: Toolchain (without parser) took 7116.09ms. Allocated memory was 142.6MB in the beginning and 220.2MB in the end (delta: 77.6MB). Free memory was 100.8MB in the beginning and 176.4MB in the end (delta: -75.5MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2023-11-19 07:38:01,026 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 102.8MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:38:01,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.34ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 89.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:38:01,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.22ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:38:01,028 INFO L158 Benchmark]: Boogie Preprocessor took 52.65ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:38:01,030 INFO L158 Benchmark]: RCFGBuilder took 623.53ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 110.8MB in the end (delta: -25.9MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2023-11-19 07:38:01,031 INFO L158 Benchmark]: TraceAbstraction took 5786.23ms. Allocated memory was 142.6MB in the beginning and 220.2MB in the end (delta: 77.6MB). Free memory was 110.2MB in the beginning and 182.6MB in the end (delta: -72.4MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB. [2023-11-19 07:38:01,032 INFO L158 Benchmark]: Witness Printer took 177.11ms. Allocated memory is still 220.2MB. Free memory was 182.6MB in the beginning and 176.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 07:38:01,035 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.32ms. Allocated memory is still 102.8MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.34ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 89.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.22ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.65ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 623.53ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 110.8MB in the end (delta: -25.9MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5786.23ms. Allocated memory was 142.6MB in the beginning and 220.2MB in the end (delta: 77.6MB). Free memory was 110.2MB in the beginning and 182.6MB in the end (delta: -72.4MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB. * Witness Printer took 177.11ms. Allocated memory is still 220.2MB. Free memory was 182.6MB in the beginning and 176.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 1372 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 976 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 461 IncrementalHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 396 mSDtfsCounter, 461 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 153 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 61 PreInvPairs, 80 NumberOfFragments, 218 HoareAnnotationTreeSize, 61 FomulaSimplifications, 1300 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 140 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 460 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 948 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 876/876 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: (((var_1_9 == var_1_5) || (((((last_1_var_1_10 + 10) <= 0) && ((var_1_10 + 10) <= 0)) && (var_1_5 <= 255)) && (0 <= var_1_5))) || (((var_1_5 <= 255) && (0 <= var_1_5)) && ((((var_1_9 / 256) * 256) + var_1_5) == (var_1_9 + ((var_1_5 / 256) * 256))))) RESULT: Ultimate proved your program to be correct! [2023-11-19 07:38:01,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60a60217-c595-4dfd-8717-3f891a65662c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE